On DR tree automata, unary algebras and syntactic path monoids
M Steinby�- Acta Cybernetica, 2017 - cyber.bibl.u-szeged.hu
… We consider deterministic root-to-frontier (DR) tree recognizers and the tree languages
recognized by them from an algebraic point of view. We make use of a correspondence between …
recognized by them from an algebraic point of view. We make use of a correspondence between …
Tree automata
F G�cseg, M Steinby�- arXiv preprint arXiv:1509.06233, 2015 - arxiv.org
… ideas of automata as algebras tree automata once emerged. … field ever since its publication
in 1984. Unfortunately, it has long … Akad�miai Kiad�, the original publisher, did not find the …
in 1984. Unfortunately, it has long … Akad�miai Kiad�, the original publisher, did not find the …
[PDF][PDF] A note on the minimalization of tree-automata
B Courcelle�- Banach Center Publications, 1988 - infona.pl
… tree-automaton defining a given regular tree language L as some quotient of any deterministic
tree-automaton … Since the polynomial system associated with a quotient-automaton is a …
tree-automaton … Since the polynomial system associated with a quotient-automaton is a …
Minimal recognizers and syntactic monoids of DR tree languages
F G�cseg, M Steinby�- …�, And Transductions: Festschrift in Honor of�…, 2001 - World Scientific
… of a tree in T to its leaves labeled with a given leaf symbol. The Nerode path congruence of
a tree … We prove a Nerode-like theorem for DR tree languages and show how Nerode path …
a tree … We prove a Nerode-like theorem for DR tree languages and show how Nerode path …
Weighted tree automata and weighted logics
M Droste, H Vogler�- Theoretical Computer Science, 2006 - Elsevier
… weighted tree automata … trees is quite similar to the weighted logic for words [18]. Assuming
familiarity with the unweighted logics for trees, background results on weighted tree automata…
familiarity with the unweighted logics for trees, background results on weighted tree automata…
General varieties of tree languages
M Steinby�- Theoretical Computer Science, 1998 - Elsevier
… The algebra d may be regarded as a tree automaton, and then tw” is the state in which &
reaches the root of t when started at any x-labelled leaf in state xc( for each x in X. This suggests …
reaches the root of t when started at any x-labelled leaf in state xc( for each x in X. This suggests …
[PDF][PDF] Bounds for tree automata with polynomial costs
… ABSTRACT We consider tree automata with costs over semirings … tree automata with costs
over finitely factorizing and monotonic semirings is decidable. We show that, for tree automata …
over finitely factorizing and monotonic semirings is decidable. We show that, for tree automata …
Finite tree automata with cost functions
H Seidl�- Theoretical Computer Science, 1994 - Elsevier
… A pair of a finite tree automaton and a cost function is called a cost automaton. There are
two … A generated tree automaton A is meant to traverse the abstract syntax tree of an input …
two … A generated tree automaton A is meant to traverse the abstract syntax tree of an input …
[BOOK][B] Algebraic theory of automata networks: An introduction
P D�m�si, CL Nehaniv - 2005 - SIAM
… We investigate automata networks as algebraic structures … almost exclusively to finite
automata networks (with notable … are only finitely many component automata in the network (ie…
automata networks (with notable … are only finitely many component automata in the network (ie…
Finite tree automata with cost functions
H Seidl�- Colloquium on Trees in Algebra and Programming, 1992 - Springer
… In Section 1, we introduce our basic notation concerning trees and tree automata. In Section
2, we introduce semirings, our notation concerning polynomials over semirings and cost …
2, we introduce semirings, our notation concerning polynomials over semirings and cost …