The size-cost of Boolean operations on constant height deterministic pushdown automata

Introduction to automata theory, languages and computation

Mathematics and Computers in Simulation · 1981 · 10.9K citations

Computing, Computer Science, Mathematics +10

Introduction to automata theory, languages, and computation

Computer Languages · 1980 · 6.9K citations

Computing, Computer Science, Mathematics +10

The state complexities of some basic operations on regular languages

Sheng Yü, Qingyu Zhuang, Kai Salomaa · Theoretical Computer Science · 1994 · 349 citations

Computing, Computer Science, Algorithms +12

Economy of description by automata, grammars, and formal systems

Albert R. Meyer, Michael J. Fischer · 1971 · 322 citations

Computing, Computer Engineering, Computer Science +12

NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES

Markus Holzer, Martin Kutrib · International Journal of Foundations of Computer Science · 2003 · 148 citations

Computing, Computer Science, Algorithms +14