- Record: found
- Abstract: not found
- Book Chapter: not found
Descriptional Complexity of Formal Systems
Automata with Reversal-Bounded Counters: A Survey
other
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references40
- Record: found
- Abstract: not found
- Article: not found
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
Marvin Minsky (1961)
- Record: found
- Abstract: not found
- Conference Proceedings: not found
Visibly pushdown languages
Rajeev Alur, P. Madhusudan (2004)
- Record: found
- Abstract: not found
- Article: not found
Reversal-Bounded Multicounter Machines and Their Decision Problems
Oscar H. Ibarra (1978)