Results: **4**

#### Formal Languages and Automata V: Conway Semiring-Semimodule Pairs and Finite Automata

This is the fth paper of a series of papers that will give a survey on several topics on formal languages and automata by using **semirings**, formal power series, matrices and xed point theory. The fth paper of this series deals with the basic results in the theory of nite automata over quemirings generalizing the classical nite automata accepting nite and innite words. The ...

#### Formal Languages and Automata VI:-algebraic systems and transducers

This is the sixth paper of a series of papers that will give a survey on several topics on formal languages and automata by using **semirings**, formal power series, matrices andxed point theory. The sixth paper of this series deals with the basic results in the theory of !-algebraic systems over quemirings generalizing the classical context-free grammars generating languages overnite ...

#### Formal languages and automata VII: Formal tree series (Part I)

This is the seventh paper of a series of papers that will give a survey on several topics on formal languages and automata by using **semirings**, formal power series, matrices and xed point theory. The seventh paper of this series deals with tree (series) automata and systems of equations over tree. The main topics of the paper are the following. 1. Tree automata (resp. nite, polynomial ...

#### Formal languages and automata VII: Formal tree series (Part II)

This is the eighth paper of a series of papers that will give a survey on several topics on formal languages and automata by using **semirings**, formal power series, matrices and xed point theory. The seventh paper of this series deals with tree (series) automata and systems of equations over tree . The main topics of the paper are the following. 1. Pushdown tree automata, whose behaviors ...