Some results concerning careful synchronization of partial automata and subset synchronization of DFA's

DOI10.1007/978-3-031-07469-1_8MaRDI QIDQ2164741zbMATH OpenOpenAlexFDO

Authors Jakub Ruszil

Publication date 16 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-07469-1_8

zbMATH Keywords

automata synchronizationČerný conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A counter example to a conjecture concerning synchronizing words in finite automata
• A lower bound for the length of the shortest carefully synchronizing words
• Asymptotic estimate of the length of a diagnostic word for a finite automaton
• Careful synchronization of partial automata with restricted alphabets
• Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
• Directable nondeterministic automata
• Hardly reachable subsets and completely reachable automata with 1-deficient words
• scientific article; zbMATH DE number 7228447 (Why is no real title available?)
• scientific article; zbMATH DE number 7152087 (Why is no real title available?)
• scientific article; zbMATH DE number 3222112 (Why is no real title available?)
• Improved upper bounds on synchronizing nondeterministic automata
• Lower bounds for synchronizing word lengths in partial automata
• On two algorithmic problems about synchronizing automata (short paper)
• On two Combinatorial Problems Arising from Automata Theory
• Preimage problems for deterministic finite automata
• Reset Sequences for Monotonic Automata
• Reset words for commutative and solvable automata
• Robust Synchronization in Markov Decision Processes
• Shortest synchronizing strings for Huffman codes
• Subset synchronization and careful synchronization of binary finite automata
• Synchronization
• Synchronizing Automata and the Černý Conjecture
• Synchronizing finite automata on Eulerian digraphs.
• The complexity of synchronizing Markov decision processes
• The Černý conjecture and 1-contracting automata
• The Černý conjecture for aperiodic automata
• Theory Is Forever

Cited in

(3)

• Subset synchronization and careful synchronization of binary finite automata
• On the smallest synchronizing terms of finite tree automata
• On the smallest synchronizing terms of finite tree automata

This page was built for publication: Some results concerning careful synchronization of partial automata and subset synchronization of DFA's

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