scientific article; zbMATH DE number 2040899
From MaRDI portal
Publication:4452055
zbMath1037.68072MaRDI QIDQ4452055
D. S. Ananichev, Mikhail V. Volkov
Publication date: 11 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2710/27100111.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
Checking Whether an Automaton Is Monotonic Is NP-complete ⋮ Černý conjecture for edge-colored digraphs with few junctions ⋮ Synchronizing monotonic automata ⋮ Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata ⋮ Genetic Algorithm for Synchronization ⋮ Synchronizing finite automata with short reset words ⋮ Sync-maximal permutation groups equal primitive permutation groups ⋮ Computing the shortest reset words of synchronizing automata ⋮ Synchronizing sequences on a class of unbounded systems using synchronized Petri nets
This page was built for publication:
