Synchronization of Pushdown Automata
From MaRDI portal
Recommendations
Cited in
(25)- Boolean algebras of unambiguous context-free languages
- Synchronizing automata over nested words
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
- A note on synchronized extension systems
- Synchronized finite automata and 2DFA reductions
- Edit distance neighbourhoods of input-driven pushdown automata
- On the power of pushing or stationary moves for input-driven pushdown automata
- Toward a theory of input-driven locally parsable languages
- Sweeping input-driven pushdown automata
- Synchronization of finite automata
- Synchronizing deterministic push-down automata can be really hard
- Synchronizing Automata Preserving a Chain of Partial Orders
- Operator precedence and the visibly pushdown property
- Sweeping input-driven pushdown automata
- On the power of pushing or stationary moves for input-driven pushdown automata
- Synchronizing generalized monotonic automata
- scientific article; zbMATH DE number 6665216 (Why is no real title available?)
- Regular languages of nested words: fixed points, automata, and synchronization
- Deterministic synchronization of automata with bounded delay
- Input-driven languages are linear conjunctive
- Synchronization of Grammars
- Synchronization of Regular Automata
- Synchronizing words for real-time deterministic pushdown automata (extended abstract)
- Generalizing input-driven languages: theoretical and practical benefits
This page was built for publication: Synchronization of Pushdown Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617051)
