Theory Is Forever
From MaRDI portal
Publication:5894871
DOI10.1007/B98751zbMath1055.68070OpenAlexW2477405540MaRDI QIDQ5894871
Masami Ito, Kayoko Shikishima-Tsuji
Publication date: 18 January 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98751
Related Items (10)
A lower bound for the length of the shortest carefully synchronizing words ⋮ Synchronization of Automata with One Undefined or Ambiguous Transition ⋮ Some results concerning careful synchronization of partial automata and subset synchronization of DFA's ⋮ 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 ⋮ Synchronizing automata with coinciding cycles ⋮ Improved upper bounds on synchronizing nondeterministic automata ⋮ Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata ⋮ The Length of Subset Reachability in Nondeterministic Automata ⋮ Attainable Values of Reset Thresholds
This page was built for publication: Theory Is Forever
