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

DOI10.1007/978-981-16-6890-6_41MaRDI QIDQ2079977zbMATH OpenOpenAlexFDO

Authors 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 boundsreal-time pushdown automatastack alphabetsynchronizing automatasynchronizing word

Mathematics Subject Classification ID

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

Cites work

• An improvement to a recent upper bound for synchronizing words of finite automata
• scientific article; zbMATH DE number 1953272 (Why is no real title available?)
• scientific article; zbMATH DE number 3222112 (Why is no real title available?)
• scientific article; zbMATH DE number 3354928 (Why is no real title available?)
• On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
• Reset Sequences for Monotonic Automata
• Synchronization of Pushdown Automata
• Synchronizing Automata and the Černý Conjecture
• Synchronizing deterministic push-down automata can be really hard
• The complexity of finding reset words in finite automata

Cited in

(2)

• Synchronizing Data Words for Register Automata
• Synchronizing deterministic push-down automata can be really hard

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079977)