scientific article; zbMATH DE number 5691263

zbMath1199.68173MaRDI QIDQ5306174

Pavel Martyugin

Publication date: 8 April 2010

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityautomatasynchronizationreset words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

Synchronizing words and monoid factorization, yielding a new parameterized complexity class? ⋮ Constrained synchronization for monotonic and solvable automata and automata with simple idempotents ⋮ Approximating the minimum length of synchronizing words is hard ⋮ Checking Whether an Automaton Is Monotonic Is NP-complete ⋮ Complexity of problems concerning reset words for cyclic and Eulerian automata ⋮ Complexity of a problem concerning reset words for Eulerian binary automata ⋮ Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata ⋮ Semicomputable points in Euclidean spaces ⋮ Sync-maximal permutation groups equal primitive permutation groups ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems ⋮ Computing the shortest reset words of synchronizing automata

This page was built for publication: