scientific article
From MaRDI portal
Publication:2707235
zbMath0959.68060MaRDI QIDQ2707235
Publication date: 1 April 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Using SAT solvers for synchronization issues in non-deterministic automata ⋮ 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 ⋮ Synchronization of Parikh automata ⋮ Synchronizing automata with coinciding cycles ⋮ Distributed graph problems through an automata-theoretic lens ⋮ D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA ⋮ The complexity of synchronizing Markov decision processes ⋮ Shortest directing words of nondeterministic directable automata ⋮ Unnamed Item ⋮ Improved upper bounds on synchronizing nondeterministic automata ⋮ Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines ⋮ Primitive Sets of Nonnegative Matrices and Synchronizing Automata ⋮ Distributed graph problems through an automata-theoretic Lens
This page was built for publication:
