79 search results - page 1 / 16 » On the Average Number of States of Partial Derivative Automa... |
89
Voted
DLT
2010
15 years 1 months ago
2010
The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of th...
111
Voted
FORMATS
2008
Springer
15 years 1 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...
88
Voted
LATA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of t...
PTS
2007
15 years 1 months ago
2007
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
121
click to vote
CONCUR
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...