1728 search results - page 2 / 346 » The Size of Power Automata |
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
CPM
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
VMCAI
2010
Springer
14 years 13 days ago
2010
Springer
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...