Results 241 to 250 of about 1,641 (261)
Some of the next articles are maybe not open access.

Rewriting and tree automata

1995
We summarize the main connections between rewriting, automata, and logical languages. We recall and illustrate from a rewriting point of view classical tree automata, Rabin and Buchi automata, which are associated with (W)SIS and (W)SkS logics. We introduce four recent classes of tree automata, closely linked to rewriting problems.
openaire   +2 more sources

Vector addition tree automata

Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., 2004
We introduce a new class of automata, which we call vector addition tree automata. These automata are a natural generalization of vector addition systems with states, which are themselves equivalent to Petri nets. Then, we prove that the decidability of provability in multiplicative exponential linear logic (which is an open problem) is equivalent to ...
de Groote, Philippe   +2 more
openaire   +3 more sources

Tree-Walking Automata

2008
A survey of tree-walking automata. The main focus is on how the expressive power is changed by adding features such as pebbles or nondeterminism.
openaire   +1 more source

Tree Automata and XPath on Compressed Trees

2006
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical subtrees in a tree, and straight-line context-free tree grammars, which moreover allow to share identical intermediate parts of a tree.
Markus Lohrey, Sebastian Maneth
openaire   +1 more source

Finite Sequentiality of Unambiguous Max-Plus Tree Automata

Theory of Computing Systems, 2021
Erik Paul
exaly  

Fuzzy Tree Automata and Syntactic Pattern Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1982
Edward T Lee
exaly  

Mode Automata and Their Compilation Into Fault Trees

Reliability Engineering and System Safety, 2002
Antoine Rauzy
exaly  

Deciding Equivalence of Finite Tree Automata

SIAM Journal on Computing, 1990
Helmut Seidl
exaly  

Tree-Walking Automata Do Not Recognize All Regular Languages

SIAM Journal on Computing, 2008
Mikołaj Bojańczyk, Thomas Colcombet
exaly  

Tree-Walking Automata Cannot Be Determinized

Theoretical Computer Science, 2006
Mikołaj Bojańczyk, Thomas Colcombet
exaly  

Home - About - Disclaimer - Privacy