scientific article; zbMATH DE number 2040899
From MaRDI portal
Publication:4452055
zbMATH Open1037.68072MaRDI QIDQ4452055FDOQ4452055
Authors: D. S. Ananichev, M. 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 of this publication is not available (Why is that?)
Recommendations
Cited In (16)
- Černý conjecture for edge-colored digraphs with few junctions
- Synchronizing sequences on a class of unbounded systems using synchronized Petri nets
- Synchronizing monotonic automata
- Genetic Algorithm for Synchronization
- The annulation threshold for partially monotonic automata
- The mirror image of the language of 2-synchronizing words
- Synchronizing automata of bounded rank
- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
- Sync-maximal permutation groups equal primitive permutation groups
- Synchronizing finite automata with short reset words
- Synchronizing automata preserving a chain of partial orders
- Developments in Language Theory
- Synchronizing generalized monotonic automata
- Computing the shortest reset words of synchronizing automata
- Checking Whether an Automaton Is Monotonic Is NP-complete
- Implementation and Application of Automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452055)
