Abstract
We introduce the synchronization of a pushdown automaton by a sequential transducer associating an integer to each input word. The visibly pushdown automata are the automata synchronized by an one state transducer whose output labels are -1,0,1. For each transducer, we can decide whether a pushdown automaton is synchronized. The pushdown automata synchronized by a given transducer accept languages which form an effective boolean algebra containing the regular languages and included in the deterministic real-time context-free languages. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Caucal, D. (2006). Synchronization of pushdown automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4036 LNCS, pp. 120–132). Springer Verlag. https://doi.org/10.1007/11779148_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
