The annulation threshold for partially monotonic automata

DOI10.3103/S1066369X10010019zbMATH Open1184.68304OpenAlexW2069629550MaRDI QIDQ845077FDOQ845077

Authors: 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

Recommendations

• Developments in Language Theory
• Subset synchronization in monotonic automata
• scientific article; zbMATH DE number 2040899
• Checking whether an automaton is monotonic is NP-complete
• Partial actions and automata

zbMATH Keywords

reset wordpartial automatonannihilating wordsynchronizable automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On finite monoids having only trivial subgroups
• Synchronizing generalized monotonic automata
• Reset Sequences for Monotonic Automata
• The Černý conjecture for aperiodic automata
• Synchronizing monotonic automata
• Synchronizing Automata Preserving a Chain of Partial Orders
• Reset words for commutative and solvable automata

Cited In (2)

• Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata
• Developments in Language Theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845077)