Synchronizing words for real-time deterministic pushdown automata (extended abstract)

DOI10.1007/978-981-16-6890-6_41OpenAlexW4225755196MaRDI QIDQ2079977

Tomoyuki Yamakami, Eitatsu Mikami

Publication date: 7 October 2022

Full work available at URL: https://doi.org/10.1007/978-981-16-6890-6_41

zbMATH Keywords

lower and upper boundssynchronizing wordsynchronizing automatareal-time pushdown automatastack alphabet

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (1)

Synchronizing deterministic push-down automata can be really hard

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
• Reset Sequences for Monotonic Automata
• Synchronizing Automata and the Černý Conjecture
• The Complexity of Finding Reset Words in Finite Automata
• Synchronization of Pushdown Automata
• An improvement to a recent upper bound for synchronizing words of finite automata

This page was built for publication: Synchronizing words for real-time deterministic pushdown automata (extended abstract)