Constrained synchronization for monotonic and solvable automata and automata with simple idempotents

DOI10.1007/978-3-031-07469-1_18OpenAlexW4285173356MaRDI QIDQ2164757

Stefan Hoffmann

Publication date: 16 August 2022

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

zbMATH Keywords

constrained synchronizationautomata with simple idempotentsmonotonic automatasolvabe automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular languages and partial commutations
• Synchronizing monotonic automata
• Constrained synchronization and subset synchronization problems for weakly acyclic automata
• Reset words for commutative and solvable automata
• Černý's conjecture and the road colouring problem
• Constrained synchronization and commutativity
• Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
• Checking Whether an Automaton Is Monotonic Is NP-complete
• Reset Sequences for Monotonic Automata
• Subset Synchronization in Monotonic Automata
• Semicomputable points in Euclidean spaces
• An improvement to a recent upper bound for synchronizing words of finite automata
• Estimation of the length of reset words for automata with simple idempotents

This page was built for publication: Constrained synchronization for monotonic and solvable automata and automata with simple idempotents