Results for:
"
Automata+theory
" in Documents
- automata a hybrid system for computational automata theory 2002 5 cita...
- Abstract. We present a system that performs computations on finite state machines, syntactic semigroups, and one-dimensional cellular automata. 1
-
Rating:
Views: (1011)
Pages: ()
Uploaded: 13-05-09
- Quantum Finite Automata and Weighted Automata 2007
- Abstract. Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has ...
-
Rating:
Views: (1008)
Pages: ()
Uploaded: 22-01-08
- PLC-Automata A New Class of Implementable Real-Time Automata 1997 33 c...
- We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in industrial practice ...
-
Rating:
Views: (1001)
Pages: ()
Uploaded: 15-05-09
- PLC-Automata A New Class of Implementable Real-Time Automata 1997 33 c...
- We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in industrial practice ...
-
Rating:
Views: (1011)
Pages: ()
Uploaded: 13-05-09
- Distributed Interval Automata A Subclass of Timed Automata 1998
- We identify a subclass of timed automata and develop its theory. These automata, called distributed interval automata, consist of a network of timed agents. The key restriction is that there is just o...
-
Rating:
Views: (1010)
Pages: ()
Uploaded: 13-05-09
- From Nondeterministic Buchi and Streett Automata to Deterministic Pari...
- Abstract In this paper we revisit Safra's determinization constructions. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Specifi...
-
Rating:
Views: (2001)
Pages: (0)
Uploaded: Publication Date: 0-0 0
- Linear Cellular Automata and Finite Automata
- Abstract Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the stu...
-
Rating:
Views: (1011)
Pages: ()
Uploaded: 08-04-09
- Factor automata of automata and applications 2007 2 citations ? 2 self...
- Abstract. An efficient data structure for representing the full index of a set of strings is the factor automaton, the minimal deterministic automaton representing the set of all factors or substrings...
-
Rating:
Views: (1005)
Pages: ()
Uploaded: 13-05-09