303 search results - page 7 / 61 » Automata on Gauss Words |
JSC
2008
13 years 8 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. A number-conserving cellular automaton is a cellular automaton whose states are integers and whose transition function keeps the sum of all cells constant throughout its ...
IPL
2002
13 years 8 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...