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

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

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 boundssynchronizing wordsynchronizing automatareal-time pushdown automatastack alphabet

Mathematics Subject Classification ID

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

Cites Work

• Synchronizing Automata and the Černý Conjecture
• Reset Sequences for Monotonic Automata
• Title not available (Why is that?)
• The complexity of finding reset words in finite automata
• On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
• Synchronization of Pushdown Automata
• Title not available (Why is that?)
• An improvement to a recent upper bound for synchronizing words of finite automata
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

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

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)