25 search results - page 1 / 5 » The Complexity of Finding Reset Words in Finite Automata |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
FORMATS
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
DLT
2008
13 years 6 months ago
2008
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
ICTAC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
FSMNLP
2005
Springer
13 years 10 months ago
2005
Springer
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...