116 search results - page 12 / 24 » Minimization of Automata |
FORMATS
2006
Springer
15 years 1 months ago
2006
Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
TAMC
2007
Springer
15 years 4 months ago
2007
Springer
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...
77
Voted
CORR
2009
Springer
14 years 8 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
SPIRE
2005
Springer
15 years 3 months ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...