Results 241 to 250 of about 1,587 (262)
Some of the next articles are maybe not open access.
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 +1 more source
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 +1 more source
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
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
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 +2 more sources
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 +2 more sources
Tree Automata and XPath on Compressed Trees
2006The 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
Lattice-valued tree pushdown automata: Pumping lemma and closure properties
International Journal of Approximate Reasoning, 2022Somaye Moghari +2 more
exaly
Tree-walking automata cannot be determinized
Theoretical Computer Science, 2006Mikolaj Bojanczyk
exaly
Tree-Walking Automata Do Not Recognize All Regular Languages
SIAM Journal on Computing, 2008Mikolaj Bojanczyk
exaly
Complementing deterministic tree-walking automata
Information Processing Letters, 2006Luc Segoufin
exaly
Fuzzy Tree Automata and Syntactic Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1982Edward T Lee
exaly