Abstract
We introduce new tools allowing to deal with the equality-problem for prefix-free languages. We illustrate our ideas by showing that, for every fixed integer t ≥ 1, the equivalence problem for t-turn deterministic pushdown automata is co-NP. This complexity result refines those of [Val74, Bee76]. © Springer-Verlag Berlin Heidelberg 2003.
Author supplied keywords
Cite
CITATION STYLE
APA
Sénizergues, G. (2003). The equivalence problem for t-turn DPDA is co-NP. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2719, 478–489. https://doi.org/10.1007/3-540-45061-0_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free