scientific article
From MaRDI portal
Publication:3115697
zbMath1249.68103MaRDI QIDQ3115697
Publication date: 10 February 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Synchronizing Automata of Bounded Rank ⋮ Synchronization of Automata with One Undefined or Ambiguous Transition ⋮ Careful synchronization of partial deterministic finite automata ⋮ Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata ⋮ Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata ⋮ Extremal Binary PFAs with Small Number of States ⋮ Lower Bounds for Synchronizing Word Lengths in Partial Automata ⋮ Improved upper bounds on synchronizing nondeterministic automata
This page was built for publication:
