scientific article; zbMATH DE number 2040899

MaRDI QIDQ4452055zbMATH OpenFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Synchronizing generalized monotonic automata
• Synchronizing Automata Preserving a Chain of Partial Orders
• Synchronizing automata preserving a chain of partial orders
• Subset synchronization in monotonic automata
• Synchronizing automata of bounded rank

Cited in

(19)

• Synchronizing finite automata with short reset words
• Synchronizing generalized monotonic automata
• 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
• Synchronizing automata of bounded rank
• Checking whether an automaton is monotonic is NP-complete
• Genetic Algorithm for Synchronization
• Subset synchronization in monotonic automata
• Subset synchronization of transitive automata
• Černý conjecture for edge-colored digraphs with few junctions
• Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
• Developments in Language Theory
• Implementation and Application of Automata
• An improved algorithm for finding the shortest synchronizing words
• Synchronizing monotonic automata
• Synchronizing automata preserving a chain of partial orders
• The annulation threshold for partially monotonic automata
• The mirror image of the language of 2-synchronizing words

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)