Publication:3115697
From MaRDI portal
zbMath1249.68103MaRDI QIDQ3115697
Publication date: 10 February 2012
68Q45: Formal languages and automata
Related Items
Lower Bounds for Synchronizing Word Lengths in Partial Automata, Extremal Binary PFAs with Small Number of States, Improved upper bounds on synchronizing nondeterministic automata, Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata, Careful synchronization of partial deterministic finite automata, Synchronizing Automata of Bounded Rank, Synchronization of Automata with One Undefined or Ambiguous Transition, Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata