scientific article; zbMATH DE number 1346363
From MaRDI portal
Publication:4266486
zbMath0952.68072MaRDI QIDQ4266486
Alexandru Mateescu, Arto Salomaa
Publication date: 24 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Composition Sequences and Synchronizing Automata, Synchronizing automata preserving a chain of partial orders, The Synchronization Problem for Locally Strongly Transitive Automata, Synchronizing random automata on a 4-letter alphabet, Synchronizing automata with a letter of deficiency 2, An algorithm for road coloring, Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees, Synchronizing Automata Preserving a Chain of Partial Orders, Synchronizing finite automata on Eulerian digraphs., The size of power automata., Unnamed Item, Slowly synchronizing automata with zero and noncomplete sets, The Synchronization Problem for Strongly Transitive Automata, Synchronizing Automata and the Černý Conjecture, 2-Synchronizing Words, A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices, A multi-parameter analysis of hard problems on deterministic finite automata, Synchronizing generalized monotonic automata, Synchronizing monotonic automata, Synchronizing automata with finitely many minimal synchronizing words, The road coloring problem, Finitely Generated Synchronizing Automata, Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete, The Length of Subset Reachability in Nondeterministic Automata, The Synchronizing Probability Function for Primitive Sets of Matrices, Composition sequences for functions over a finite domain.
