For a tree automaton A over a ranked alphabet , we study the ground tree transformation (A) induced by A and the restriction Γ(A) of the congruence β \* A to terms over . We deΓΏne a congruence relation β A Γ A on A, called the determiner of A, and the quotient tree automaton A= . We show the followi
β¦ LIBER β¦
Quantaloidal nuclei, the syntactic congruence and tree automata
β Scribed by Kimmo I. Rosenthal
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 1008 KB
- Volume
- 77
- Category
- Article
- ISSN
- 0022-4049
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On ground tree transformations and congr
β
SΓ‘ndor VΓ‘gvΓΆlgyi
π
Article
π
2003
π
Elsevier Science
π
English
β 230 KB
Syntactic monoids in the construction of
β
H. JΓΌrgensen; A. Salomaa
π
Article
π
1985
π
Springer
π
English
β 630 KB
Understanding the Constraints on Syntact
β
Julie E. Boland; Allison Blodgett
π
Article
π
2001
π
Elsevier Science
π
English
β 149 KB
Alternating automata, the weak monadic t
β
David E. Muller; Ahmed Saoudi; Paul E. Schupp
π
Article
π
1992
π
Elsevier Science
π
English
β 882 KB
Phylogenetic Utility of the External Tra
β
Bruce G. Baldwin; Staci Markos
π
Article
π
1998
π
Elsevier Science
π
English
β 479 KB
The 3Π region of the external transcribed spacer (ETS) of 18S-26S nuclear ribosomal DNA was sequenced in 19 representatives of Calycadenia/Osmadenia and two outgroup species (Compositae) to assess its utility for phylogeny reconstruction compared to rDNA internal transcribed spacer (ITS) data. Unive