620 search results - page 96 / 124 » Algorithms and computations on cellular automata |
179
click to vote
WIA
2009
Springer
16 years 1 months ago
2009
Springer
FAdo is an ongoing project which aims to provide a set of tools for symbolic manipulation of formal languages. To allow highlevel programming with complex data structures, easy pro...
162
click to vote
CONIELECOMP
2005
IEEE
16 years 6 days ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
185
click to vote
LICS
2003
IEEE
15 years 12 months ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
158
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
196
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...