“…A distributive Σ-algebra A, +, 0, Ω is briefly denoted by A if +, 0 and Ω are understood. Similar algebras are considered in Courcelle [15] and Bozapalidis [10].…”
Section: For All Index Sets I and All Families (A I | I ∈ I) In A Anmentioning
confidence: 95%
“…The definitions and results on distributive algebras are heavily influenced by Bozapalidis [10], especially by his notion of a K-Γ-algebra. He noticed that the multilinear mappings of his well ω-additive K-Γ-algebras assure that certain important mappings induced by formal power series are continuous.…”
Section: Preliminariesmentioning
confidence: 99%
“…He noticed that the multilinear mappings of his well ω-additive K-Γ-algebras assure that certain important mappings induced by formal power series are continuous. (See Theorem 2 of Bozapalidis [10].) We have tried in the forthcoming definition of a distributive algebra to simplify the used type of algebra but to save the important results.…”
Section: Preliminariesmentioning
confidence: 99%
“…Formal tree series were introduced by Berstel, Reutenauer [5], and then extensively studied by Bozapalidis [7,8,9,10,11], Bozapalidis, Rahonis [12], Kuich [38,39,40,41,43], Engelfriet, Fülöp, Vogler [19] and Fülöp, Vogler [23].…”
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:
“…A distributive Σ-algebra A, +, 0, Ω is briefly denoted by A if +, 0 and Ω are understood. Similar algebras are considered in Courcelle [15] and Bozapalidis [10].…”
Section: For All Index Sets I and All Families (A I | I ∈ I) In A Anmentioning
confidence: 95%
“…The definitions and results on distributive algebras are heavily influenced by Bozapalidis [10], especially by his notion of a K-Γ-algebra. He noticed that the multilinear mappings of his well ω-additive K-Γ-algebras assure that certain important mappings induced by formal power series are continuous.…”
Section: Preliminariesmentioning
confidence: 99%
“…He noticed that the multilinear mappings of his well ω-additive K-Γ-algebras assure that certain important mappings induced by formal power series are continuous. (See Theorem 2 of Bozapalidis [10].) We have tried in the forthcoming definition of a distributive algebra to simplify the used type of algebra but to save the important results.…”
Section: Preliminariesmentioning
confidence: 99%
“…Formal tree series were introduced by Berstel, Reutenauer [5], and then extensively studied by Bozapalidis [7,8,9,10,11], Bozapalidis, Rahonis [12], Kuich [38,39,40,41,43], Engelfriet, Fülöp, Vogler [19] and Fülöp, Vogler [23].…”
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:
“…[Boz99], and, independently, [EKL10]; the essence of the result can be traced back to [BR82,Tha67,CS63]). In other words, the least solution can be obtained by adding the values under V of all its derivation trees.…”
Abstract. Systems of equations over ω-continuous semirings can be mapped to context-free grammars in a natural way. We show how an analysis of the derivation trees of the grammar yields new algorithms for approximating and even computing exactly the least solution of the system.
We investigate context-free (CF) series on trees with coefficients on a semiring; they are obtained as components of the least solutions of systems of equations having polynomials on their right-hand sides. The relationship between CF series on trees and CF tree-grammars and recursive program schemes is also examined. Polypodes, a new algebraic structure, are introduced in order to study in common series on trees and words and applications are given.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.