Simplifying DPDA using supplementary information

Authors:
Pavel Labath;Branislav Rovan
Affiliations:
Department of Computer Science, Comenius University, Bratislava, Slovakia;Department of Computer Science, Comenius University, Bratislava, Slovakia
Venue:
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Year:
2011

Citing 3
Cited 1

Products of automata

Products of automata
Regularity and Related Problems for Deterministic Pushdown Automata

Journal of the ACM (JACM)
Assisted problem solving and decompositions of finite automata

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science

Modeling time criticality of information

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the effect of using supplementary information on the complexity of deterministic pushdown automata. This continues the study of assisted problem solving initiated in [Gaži, Rovan 2008]. We study deterministic PDA that can assume its input to be in a given regular advisory language. We first show that no suitable complexity measure for DPDA combining the number of states and stack symbols exists. Next we prove tight bounds on the state complexity of an infinite sequence of deterministic context-free languages and show that no supplementary regular information can decrease the state complexity of the DPDA recognizing them. We also find an infinite sequence of deterministic context-free languages for which a suitable supplementary regular information enables the construction of a significantly simpler DPDA.