Semirings, Automata, Languages
- W. Kuich, A. Salomaa
- Computer Science, MathematicsEATCS Monographs on Theoretical Computer Science
- 20 December 1985
This chapter discusses automata in terms of Matrices, and discusses Commuting Variables: Decidability and Parikh's Theorem, as well as algebraic systems and Context-Free Languages.
Handbook of Weighted Automata
This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications, and presents a detailed survey of the state of the art and pointers to future research.
Semirings and Formal Power Series
This chapter presents basic foundations for the theory of weighted automata: semirings and formal power series. A fundamental question is how to extend the star operation (Kleene iteration) from…
Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata
- W. Kuich
- Computer Science, MathematicsHandbook of Formal Languages
- 1 April 1997
The purpose of Chapter 9 is to develop some classical results on formal languages and automata by an algebraic treatment using semirings, formal power series and matrices. The use of semirings,…
On the Entropy of Context-Free Languages
- W. Kuich
- Computer ScienceInformation and Control
- 1 April 1970
Formal Power Series over Trees
- W. Kuich
- MathematicsInternational Conference on Developments in…
- 1997
Tree Transducers and Formal Tree Series
- W. Kuich
- Computer ScienceActa Cybernetica
- 1 February 1999
W e introduce tree transducers over formal tree series as a generalization of a restricted type of root-to-frontier tree transducers and show that linear nondeleting recognizable tree transducers do…
Formal Tree Series
This survey reports on generalizations of some results on formal tree languages, tree grammars and tree automata achieved by an algebraic treatment using semirings, fixed point theory, formal tree series and matrices that are very satisfactory from a mathematical point of view.
The Kleene and the Parikh Theorem in Complete Semirings
- W. Kuich
- MathematicsInternational Colloquium on Automata, Languages…
- 1 July 1987
The Kleene and the Parikh Theorem are generalized to complete semirings with the additional property that limits can be defined by infinite sums.
...
...