346 search results - page 1 / 70 » Determinizing Asynchronous Automata |
ICALP
1994
Springer
13 years 8 months ago
1994
Springer
ICALP
2004
Springer
13 years 9 months ago
2004
Springer
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...
AUTOMATICA
2008
13 years 2 months ago
2008
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in dif...
CONCUR
1998
Springer
13 years 8 months ago
1998
Springer
FCT
2005
Springer
13 years 9 months ago
2005
Springer
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...