171 search results - page 5 / 35 » On the Power of Tree-Walking Automata |
FCT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
97
Voted
LATIN
2004
Springer
15 years 5 months ago
2004
Springer
In a preceding paper [6], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite...
70
Voted
ACRI
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem....
120
Voted
PAAMS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
113
Voted
CONCUR
2001
Springer
15 years 4 months ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...