Sciweavers

303 search results - page 38 / 61
» Automata on Gauss Words
Sort
View
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 9 months ago
The road coloring problem
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
A. N. Trahtman
PC
2006
218views Management» more  PC 2006»
13 years 9 months ago
A model based on cellular automata for the parallel simulation of 3D unsaturated flow
Cellular automata (CA) are discrete dynamic systems that have been used for modeling many physical systems. CA are often used as an alternative to model and solve large-scale syst...
Gianluigi Folino, Giuseppe Mendicino, Alfonso Sena...
IS
2010
13 years 8 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
JUCS
2010
161views more  JUCS 2010»
13 years 8 months ago
Evaluating Linear XPath Expressions by Pattern-Matching Automata
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soinine...
TCS
2011
13 years 4 months ago
Communication complexity and intrinsic universality in cellular automata
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...