Approximating Minimum Reset Sequences (Q3073634)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Approximating Minimum Reset Sequences	scientific article

Statements

scholarly article

0 references

Approximating Minimum Reset Sequences (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-18098-9_17

0 references

Michael Gerbush

0 references

0 references

Implementation and Application of Automata

0 references

publication date

11 February 2011

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-18098-9_17

0 references

0 references

0 references

Reset Sequences for Monotonic Automata

0 references

On two Combinatorial Problems Arising from Automata Theory

0 references

In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton

0 references

Synchronizing generalized monotonic automata

0 references

Synchronizing finite automata on Eulerian digraphs.

0 references

Approximating the minimum length of synchronizing words is hard

0 references

The Complexity of Finding Reset Words in Finite Automata

0 references

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences

0 references

Algorithmic construction of sets for <i>k</i> -restrictions

0 references

Synchronizing Automata and the Černý Conjecture

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3073634

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3073634&oldid=35213716"