| Publication | Date of Publication | Type |
|---|
Quasi-realtime languages (extended abstract)
Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 | 2014-03-14 | Paper |
Formal Languages: Origins and Directions
IEEE Annals of the History of Computing | 2002-11-25 | Paper |
scientific article; zbMATH DE number 176239 (Why is no real title available?)
| 1993-05-18 | Paper |
A note on the best-case complexity
Information Processing Letters | 1989-01-01 | Paper |
On the IO-complexity and approximation languages
Information Processing Letters | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4049111 (Why is no real title available?)
| 1987-01-01 | Paper |
Single-tape reset machines
RAIRO - Theoretical Informatics and Applications | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3974324 (Why is no real title available?)
| 1986-01-01 | Paper |
Theory of program structures: schemes, semantics, verification. 2nd printing
Lecture Notes in Computer Science | 1985-01-01 | Paper |
Matching and spanning in certain planar graphs
Mathematical Systems Theory | 1983-01-01 | Paper |
A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors
SIAM Journal on Computing | 1982-01-01 | Paper |
Superdeterministic PDAs
Journal of the ACM | 1980-01-01 | Paper |
Reset machines
Journal of Computer and System Sciences | 1979-01-01 | Paper |
Superdeterministic DPDAs: The method of accepting does affect decision problems
Journal of Computer and System Sciences | 1979-01-01 | Paper |
Monadic recursion schemes: The effect of constants
Journal of Computer and System Sciences | 1979-01-01 | Paper |
Linearity is polynomially decidable for realtime pushdown store automata
Information and Control | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3688749 (Why is no real title available?)
| 1979-01-01 | Paper |
Remarks on blind and partially blind one-way multicounter machines
Theoretical Computer Science | 1978-01-01 | Paper |
One way finite visit automata
Theoretical Computer Science | 1978-01-01 | Paper |
On equivalence and subclass containment problems for deterministic context-free languages
Information Processing Letters | 1978-01-01 | Paper |
Visits, crosses, and reversals for nondeterministic off-line machines
Information and Control | 1978-01-01 | Paper |
Hierarchy theorems for two-way finite state transducers
Acta Informatica | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3602690 (Why is no real title available?)
| 1978-01-01 | Paper |
scientific article; zbMATH DE number 3603267 (Why is no real title available?)
| 1978-01-01 | Paper |
scientific article; zbMATH DE number 3604381 (Why is no real title available?)
| 1978-01-01 | Paper |
Comments on universal and left universal grammars, context-sensitive languages, and context-free grammar forms
Information and Control | 1978-01-01 | Paper |
Control sets on context-free grammar forms
Journal of Computer and System Sciences | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3560777 (Why is no real title available?)
| 1977-01-01 | Paper |
Remarks on the complexity of nondeterministic counter languages
Theoretical Computer Science | 1976-01-01 | Paper |
Some uniformly erasable families of languages
Theoretical Computer Science | 1976-01-01 | Paper |
One counter languages and the IRS condition
Journal of Computer and System Sciences | 1975-01-01 | Paper |
Theory of program structures: Schemes, semantics, verification
Lecture Notes in Computer Science | 1975-01-01 | Paper |
Erasable context-free languages
Information and Control | 1975-01-01 | Paper |
Uniformly erasable AFL
Journal of Computer and System Sciences | 1975-01-01 | Paper |
scientific article; zbMATH DE number 3483582 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3481859 (Why is no real title available?)
| 1975-01-01 | Paper |
A Remark on Code Sets and Context-Free Languages
IEEE Transactions on Computers | 1975-01-01 | Paper |
scientific article; zbMATH DE number 3483583 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3483586 (Why is no real title available?)
| 1975-01-01 | Paper |
Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
SIAM Journal on Computing | 1974-01-01 | Paper |
Some restrictions onW-grammars
International Journal of Computer & Information Sciences | 1974-01-01 | Paper |
scientific article; zbMATH DE number 3454821 (Why is no real title available?)
| 1974-01-01 | Paper |
scientific article; zbMATH DE number 3617582 (Why is no real title available?)
| 1974-01-01 | Paper |
The Hardest Context-Free Language
SIAM Journal on Computing | 1973-01-01 | Paper |
On AFL generators for finitely encoded AFA
Journal of Computer and System Sciences | 1973-01-01 | Paper |
scientific article; zbMATH DE number 3502810 (Why is no real title available?)
| 1973-01-01 | Paper |
Multitape AFA
Journal of the ACM | 1972-01-01 | Paper |
Syntactic operators on full semiAFLs
Journal of Computer and System Sciences | 1972-01-01 | Paper |
Erasing in context-free AFLs
Information and Control | 1972-01-01 | Paper |
A generalization of Parikh's semilinear theorem
Discrete Mathematics | 1972-01-01 | Paper |
Characteristic and ultrarealtime languages
Information and Control | 1971-01-01 | Paper |
Ambiguity in Graphs and Expressions
IEEE Transactions on Computers | 1971-01-01 | Paper |
Quasi-realtime languages
Mathematical Systems Theory | 1970-01-01 | Paper |
Full AFLs and nested iterated substitution
Information and Control | 1970-01-01 | Paper |
Principal AFL
Journal of Computer and System Sciences | 1970-01-01 | Paper |
Chains of full AFL's
Mathematical Systems Theory | 1970-01-01 | Paper |
Time- and tape-bounded Turing acceptors and AFLs
Journal of Computer and System Sciences | 1970-01-01 | Paper |
Tape-bounded Turing acceptors and principal AFLs
Journal of Computer and System Sciences | 1970-01-01 | Paper |
An Infinite Hierarchy of Context-Free Languages
Journal of the ACM | 1969-01-01 | Paper |
Scattered context grammars
Journal of Computer and System Sciences | 1969-01-01 | Paper |
Checking automata and one-way stack languages
Journal of Computer and System Sciences | 1969-01-01 | Paper |
Studies in abstract families of languages
Memoirs of the American Mathematical Society | 1969-01-01 | Paper |
scientific article; zbMATH DE number 3461845 (Why is no real title available?)
| 1969-01-01 | Paper |
scientific article; zbMATH DE number 3310087 (Why is no real title available?)
| 1969-01-01 | Paper |
A note on undecidable properties of formal languages
Mathematical Systems Theory | 1968-01-01 | Paper |
Stack automata and compiling
Journal of the ACM | 1967-01-01 | Paper |
A Note on Pushdown Store Automata and Regular Systems
| 1967-01-01 | Paper |
One-way stack automata
Journal of the ACM | 1967-01-01 | Paper |
scientific article; zbMATH DE number 3286898 (Why is no real title available?)
| 1967-01-01 | Paper |
Deterministic context free languages
Information and Control | 1966-01-01 | Paper |
Mappings which preserve context sensitive languages
Information and Control | 1966-01-01 | Paper |
The Unsolvability of the Recognition of Linear Context-Free Languages
Journal of the ACM | 1966-01-01 | Paper |
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM | 1965-01-01 | Paper |
Formal parsing systems
Communications of the ACM | 1964-01-01 | Paper |
The undecidability of the ambiguity problem for minimal linear grammars
Information and Control | 1963-01-01 | Paper |
