426 search results - page 3 / 86 » Synchronization of Regular Automata |
IMSCCS
2006
IEEE
14 years 1 months ago
2006
IEEE
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
ADVCS
2007
13 years 7 months ago
2007
Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and als...
MICS
2008
13 years 7 months ago
2008
We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second o...
WIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approac...
ICTAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...