Synchronizing monotonic automata

DOI10.1016/J.TCS.2004.03.068zbMath1160.68398OpenAlexW1502758008MaRDI QIDQ703567

D. S. Ananichev, Mikhail V. Volkov

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.068

zbMATH Keywords

Interval rank of a wordMonotonic automataOrder preserving transformationRank of a wordSynchronizing automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (16)

The annulation threshold for partially monotonic automata ⋮ Constrained synchronization for monotonic and solvable automata and automata with simple idempotents ⋮ Groups synchronizing a transformation of non-uniform kernel ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ Synchronizing sequences for road colored digraphs ⋮ Complexity of problems concerning reset words for cyclic and Eulerian automata ⋮ 2-Synchronizing Words ⋮ A series of slowly synchronizing automata with a zero state over a small alphabet ⋮ Synchronizing generalized monotonic automata ⋮ Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata ⋮ The relation between preset distinguishing sequences and synchronizing sequences ⋮ COMPAS - A Computing Package for Synchronization ⋮ Synchronizing finite automata with short reset words ⋮ Synchronization problems in automata without non-trivial cycles ⋮ Extremal synchronizing circular automata ⋮ Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata

Cites Work

• Reset Sequences for Monotonic Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronizing monotonic automata