| Publication | Date of Publication | Type |
|---|
Measuring nondeterminism in pushdown automata
Lecture Notes in Computer Science | 2022-11-09 | Paper |
| Descriptional complexity of machines with limited resources | 2007-10-17 | Paper |
Measuring nondeterminism in pushdown automata
Journal of Computer and System Sciences | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 1809726 (Why is no real title available?) | 2002-09-30 | Paper |
On reducing the number of stack symbols in a PDA
Mathematical Systems Theory | 1994-08-21 | Paper |
On the relation between ambiguity and nondeterminism in finite automata
Information and Computation | 1993-01-16 | Paper |
On measuring nondeterminism in regular languages
Information and Computation | 1990-01-01 | Paper |
Unions of certain bounded deterministic languages
International Journal of Computer Mathematics | 1984-01-01 | Paper |
On the equality of grammatical families
Journal of Computer and System Sciences | 1983-01-01 | Paper |
A prime decomposition theorem for grammatical families
Journal of Computer and System Sciences | 1982-01-01 | Paper |
A pushdown automaton or a context-free grammar - which is more economical?
Theoretical Computer Science | 1982-01-01 | Paper |
On reducing the number of states in a PDA
Mathematical Systems Theory | 1982-01-01 | Paper |
A characterization theorem for certain bounded deterministic context-free languages
Information and Control | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3646311 (Why is no real title available?) | 1979-01-01 | Paper |
A simplified proof of Parikh's theorem
Discrete Mathematics | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3648125 (Why is no real title available?) | 1977-01-01 | Paper |
Continuous operations on languages
Mathematical Systems Theory | 1977-01-01 | Paper |
Some uniformly erasable families of languages
Theoretical Computer Science | 1976-01-01 | Paper |
Bounded AFLs
Journal of Computer and System Sciences | 1976-01-01 | Paper |
Uniformly erasable AFL
Journal of Computer and System Sciences | 1975-01-01 | Paper |
Some independent families of one-letter languages
Journal of Computer and System Sciences | 1975-01-01 | Paper |
Intersection-closed full AFL and the recursively enumerable languages
Information and Control | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3557255 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3380158 (Why is no real title available?) | 1972-01-01 | Paper |
Substitution and bounded languages
Journal of Computer and System Sciences | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3397100 (Why is no real title available?) | 1971-01-01 | Paper |
