The annulation threshold for partially monotonic automata

DOI10.3103/S1066369X10010019zbMath1184.68304OpenAlexW2069629550MaRDI QIDQ845077

D. S. Ananichev

Publication date: 5 February 2010

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x10010019

zbMATH Keywords

reset wordpartial automatonannihilating wordsynchronizable automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata

Cites Work

• Unnamed Item
• Synchronizing monotonic automata
• Reset words for commutative and solvable automata
• Synchronizing generalized monotonic automata
• Reset Sequences for Monotonic Automata
• Synchronizing Automata Preserving a Chain of Partial Orders
• On finite monoids having only trivial subgroups

This page was built for publication: The annulation threshold for partially monotonic automata