| Publication | Date of Publication | Type |
|---|
| Quasi-realtime languages (extended abstract) | 2014-03-14 | Paper |
| Formal Languages: Origins and Directions | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035343 | 1993-05-18 | Paper |
| A note on the best-case complexity | 1989-01-01 | Paper |
| On the IO-complexity and approximation languages | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786000 | 1987-01-01 | Paper |
| Single-tape reset machines | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3740260 | 1986-01-01 | Paper |
| Theory of program structures: schemes, semantics, verification. 2nd printing | 1985-01-01 | Paper |
| Matching and spanning in certain planar graphs | 1983-01-01 | Paper |
| A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors | 1982-01-01 | Paper |
| Superdeterministic PDAs | 1980-01-01 | Paper |
| Reset machines | 1979-01-01 | Paper |
| Superdeterministic DPDAs: The method of accepting does affect decision problems | 1979-01-01 | Paper |
| Monadic recursion schemes: The effect of constants | 1979-01-01 | Paper |
| Linearity is polynomially decidable for realtime pushdown store automata | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3883536 | 1979-01-01 | Paper |
| Remarks on blind and partially blind one-way multicounter machines | 1978-01-01 | Paper |
| One way finite visit automata | 1978-01-01 | Paper |
| On equivalence and subclass containment problems for deterministic context-free languages | 1978-01-01 | Paper |
| Visits, crosses, and reversals for nondeterministic off-line machines | 1978-01-01 | Paper |
| Hierarchy theorems for two-way finite state transducers | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4168079 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4168602 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4170259 | 1978-01-01 | Paper |
| Comments on universal and left universal grammars, context-sensitive languages, and context-free grammar forms | 1978-01-01 | Paper |
| Control sets on context-free grammar forms | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131691 | 1977-01-01 | Paper |
| Remarks on the complexity of nondeterministic counter languages | 1976-01-01 | Paper |
| Some uniformly erasable families of languages | 1976-01-01 | Paper |
| One counter languages and the IRS condition | 1975-01-01 | Paper |
| Theory of program structures: Schemes, semantics, verification | 1975-01-01 | Paper |
| Erasable context-free languages | 1975-01-01 | Paper |
| Uniformly erasable AFL | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4066625 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4065053 | 1975-01-01 | Paper |
| A Remark on Code Sets and Context-Free Languages | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4066626 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4066629 | 1975-01-01 | Paper |
| Jump PDA’s and Hierarchies of Deterministic Context-Free Languages | 1974-01-01 | Paper |
| Some restrictions onW-grammars | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4041113 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4181300 | 1974-01-01 | Paper |
| The Hardest Context-Free Language | 1973-01-01 | Paper |
| On AFL generators for finitely encoded AFA | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083032 | 1973-01-01 | Paper |
| Multitape AFA | 1972-01-01 | Paper |
| Syntactic operators on full semiAFLs | 1972-01-01 | Paper |
| Erasing in context-free AFLs | 1972-01-01 | Paper |
| A generalization of Parikh's semilinear theorem | 1972-01-01 | Paper |
| Characteristic and ultrarealtime languages | 1971-01-01 | Paper |
| Ambiguity in Graphs and Expressions | 1971-01-01 | Paper |
| Quasi-realtime languages | 1970-01-01 | Paper |
| Full AFLs and nested iterated substitution | 1970-01-01 | Paper |
| Principal AFL | 1970-01-01 | Paper |
| Chains of full AFL's | 1970-01-01 | Paper |
| Time- and tape-bounded Turing acceptors and AFLs | 1970-01-01 | Paper |
| Tape-bounded Turing acceptors and principal AFLs | 1970-01-01 | Paper |
| An Infinite Hierarchy of Context-Free Languages | 1969-01-01 | Paper |
| Scattered context grammars | 1969-01-01 | Paper |
| Checking automata and one-way stack languages | 1969-01-01 | Paper |
| Studies in abstract families of languages | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4047460 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5590813 | 1969-01-01 | Paper |
| A note on undecidable properties of formal languages | 1968-01-01 | Paper |
| Stack automata and compiling | 1967-01-01 | Paper |
| A Note on Pushdown Store Automata and Regular Systems | 1967-01-01 | Paper |
| One-way stack automata | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5570214 | 1967-01-01 | Paper |
| Deterministic context free languages | 1966-01-01 | Paper |
| Mappings which preserve context sensitive languages | 1966-01-01 | Paper |
| The Unsolvability of the Recognition of Linear Context-Free Languages | 1966-01-01 | Paper |
| A New Normal-Form Theorem for Context-Free Phrase Structure Grammars | 1965-01-01 | Paper |
| Formal parsing systems | 1964-01-01 | Paper |
| The undecidability of the ambiguity problem for minimal linear grammars | 1963-01-01 | Paper |
