Removing nondeterminism in constant height pushdown automata

Authors:
Zuzana Bednárová;Viliam Geffert;Carlo Mereghetti;Beatrice Palano
Affiliations:
Department of Computer Science, P. J. Šafárik University, Košice, Slovakia;Department of Computer Science, P. J. Šafárik University, Košice, Slovakia;Dipartimento di Informatica, Università degli Studi di Milano, Milano, Italy;Dipartimento di Informatica, Università degli Studi di Milano, Milano, Italy
Venue:
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Year:
2012

Citing 14
Cited 0

Alternation

Journal of the ACM (JACM)
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal Simulations between Unary Automata

SIAM Journal on Computing
Algorithmics for Hard Problems

Algorithmics for Hard Problems
Converting two-way nondeterministic unary automata into simpler automata

Theoretical Computer Science - Mathematical foundations of computer science
Errata to: "finite automata and unary languages"

Theoretical Computer Science
More Concise Representation of Regular Languages by Automata and Regular Expressions

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Size Complexity of Two-Way Finite Automata

DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Finite automata and their decision problems

IBM Journal of Research and Development
The reduction of two-way automata to one-way automata

IBM Journal of Research and Development
Quantum Computation and Quantum Information: 10th Anniversary Edition

Quantum Computation and Quantum Information: 10th Anniversary Edition
The size-cost of Boolean operations on constant height deterministic pushdown automata

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the descriptional cost of converting constant height nondeterministic pushdown automata into equivalent deterministic devices. We show a double-exponential upper bound for this conversion, together with a super-exponential lower bound.