213 search results - page 8 / 43 » Relating Word and Tree Automata |
TCS
2010
13 years 2 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
CSB
2003
IEEE
14 years 23 days ago
2003
IEEE
We describe a method for finding ungapped conserved words in rRNA sequences that is effective, utilizes evolutionary information and does not depend on multiple sequence alignment...