| Publication | Date of Publication | Type |
|---|
Measuring nondeterminism in pushdown automata
Lecture Notes in Computer Science | 2022-11-09 | Paper |
| Remembering Chandra Kintala | 2021-02-24 | Paper |
Remembering Chandra Kintala
(available as arXiv preprint) | 2021-02-24 | Paper |
In memoriam Chandra Kintala
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
The Boolean closure of linear context-free languages
Acta Informatica | 2008-06-17 | Paper |
| Descriptional complexity of machines with limited resources | 2007-10-17 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Measuring nondeterminism in pushdown automata
Journal of Computer and System Sciences | 2005-12-07 | Paper |
On the size of parsers and \(\text{LR}(k)\)-grammars
Theoretical Computer Science | 2000-08-21 | Paper |
On reducing the number of stack symbols in a PDA
Mathematical Systems Theory | 1994-08-21 | Paper |
Concise representations of regular languages by degree and probabilistic finite automata
Mathematical Systems Theory | 1993-12-09 | 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 |
| scientific article; zbMATH DE number 3963203 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3892563 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3911683 (Why is no real title available?) | 1983-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 |
Concise description of finite languages
Theoretical Computer Science | 1981-01-01 | Paper |
Amounts of nondeterminism in finite automata
Acta Informatica | 1980-01-01 | Paper |
On strict interpretations of grammar forms
Mathematical Systems Theory | 1979-01-01 | Paper |
Nondeterminism and Boolean operations in pda's
Journal of Computer and System Sciences | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3592979 (Why is no real title available?) | 1978-01-01 | Paper |
A note on classes of complements and the LBA-problem
Acta Informatica | 1978-01-01 | Paper |
Degree-languages: A new concept of acceptance
Journal of Computer and System Sciences | 1977-01-01 | Paper |
Size, index, and context-sensitivity of controlled partition grammars
Mathematical Systems Theory | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3566216 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3426894 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3470032 (Why is no real title available?) | 1973-01-01 | Paper |
