| |
| 1997 | ||
|---|---|---|
| 12 | H. Petersen: The Equivalence of Pebbles and Sensing Heads for Finite Automata. FCT 1997: 400-410 | |
| 1996 | ||
| 11 | EE | H. Petersen: On the Language of Primitive Words. Theor. Comput. Sci. 161(1&2): 141-156 (1996) |
| 1995 | ||
| 10 | H. Petersen: Some Results Concerning Two-Dimensional Turing Machines and Finite Automata. FCT 1995: 374-382 | |
| 9 | H. Petersen: Alternation in Simple Devices. ICALP 1995: 315-323 | |
| 8 | H. Petersen: Automata with Sensing Heads. ISTCS 1995: 150-157 | |
| 7 | EE | H. Petersen: On Space Functions Fully Constructed by Two-Dimensional Turing Machines. Inf. Process. Lett. 54(1): 9-10 (1995) |
| 6 | EE | H. Petersen: A Remark on a Paper by Armando B. Matos. Theor. Comput. Sci. 141(1&2): 329-330 (1995) |
| 1994 | ||
| 5 | H. Petersen: The Ambiguity of Primitive Words. STACS 1994: 679-690 | |
| 4 | M. Ladermann, H. Petersen: Notes on Looping Deterministic Two-Way Pushdown Automata. Inf. Process. Lett. 49(3): 123-127 (1994) | |
| 3 | H. Petersen: Refined Simulation of Multihead Automata. Inf. Process. Lett. 52(5): 229-233 (1994) | |
| 2 | H. Petersen: On the Determinacy Problem for Two-Way Pushdown Automata. Inf. Process. Lett. 52(6): 323-324 (1994) | |
| 1975 | ||
| 1 | H. Petersen, Norbert Vorstädt: Zur Strukturierung mehrstufiger Mustererkennungssysteme. GI Jahrestagung 1975: 333-347 | |
| 1 | M. Ladermann | [4] |
| 2 | Norbert Vorstädt | [1] |