79 search results - page 2 / 16 » On the Average Number of States of Partial Derivative Automa... |
WIA
2004
Springer
14 years 21 days ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
FORMATS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
DSRT
2005
IEEE
14 years 29 days ago
2005
IEEE
Timed automata provide useful state machine based representations for the validation and verification of realtime control systems. This paper introduces an algorithmic methodolog...
FSMNLP
2005
Springer
14 years 26 days 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...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...