Formal languages
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Discrete Applied Mathematics
Flip-pushdown automata: nondeterminism is better than determinism
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Flip-pushdown automata: k + 1 pushdown reversals are better than k
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Gaining power by input operations: finite automata and beyond
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Some non-semi-decidability problems for linear and deterministic context-free languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Parikh's theorem and descriptional complexity
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Regular and context-free pattern languages over small alphabets
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Regular and context-free pattern languages over small alphabets
Theoretical Computer Science
| Hi-index | 0.01 |