Formal Tree Series
DOI:
https://doi.org/10.7146/brics.v9i21.21737Resumé
In this survey we generalize some results on formal tree languages, tree grammars and tree automata by an algebraic treatment using semirings, fixed point theory, formal tree series and matrices. The use of these mathematical constructs makes definitions, constructions, and proofs more satisfactory from an mathematical point of view than the customary ones. The contents of this survey paper is indicated by the titles of the sections:- 1.
- Introduction
- 2.
- Preliminaries
- 3.
- Tree automata and systems of equations
- 4.
- Closure properties and a Kleene Theorem for recognizable tree series
- 5.
- Pushdown tree automata, algebraic tree systems, and a Kleene Theorem
- 6.
- Tree series transducers
- 7.
- Full abstract families of tree series
- 8.
- Connections to formal power series
Downloads
Publiceret
2002-04-05
Citation/Eksport
Ésik, Z., & Kuich, W. (2002). Formal Tree Series. BRICS Report Series, 9(21). https://doi.org/10.7146/brics.v9i21.21737
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
