48 search results - page 4 / 10 » On the Complexity of Intersecting Finite State Automata |
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
With resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies an...
VIS
2007
IEEE
14 years 8 months ago
2007
IEEE
Modern unsteady (multi-)field visualizations require an effective reduction of the data to be displayed. From a huge amount of information the most informative parts have to be ext...
ANCS
2009
ACM
13 years 5 months ago
2009
ACM
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...