39 search results - page 2 / 8 » Lattice Automata |
FOSSACS
2011
Springer
12 years 8 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
ACL
1998
13 years 6 months ago
1998
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an autom...
CG
2010
Springer
13 years 4 months ago
2010
Springer
Cyclic cellular automata on the integer planar lattice are known to typically evolve through distinct phases ending with minimal periodic terminal states that usually appear as in...
FUIN
2008
13 years 5 months ago
2008
Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function...
MCU
1998
13 years 6 months ago
1998
Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of in nite lattices. In the one-dimensionalcase, there exist BCA with 11 states which are unive...