Regularly Controlled Formal Power Series
Download:
|
|
by Henning Fernau, Werner Kuich
http://www-fs.informatik.uni-tuebingen.de/~fernau/pub-fernau/papers/ps/Kuich.ps.gz
Add To MetaCart
Abstract:
Regulated rewriting is one of the classical topics in formal language theory, see [2, 3]. This paper starts the research of regulated rewriting in the framework of formal power series, cf. [6, 7, 9]. More specically, we model what is known as \free derivations" and \leftmost derivations of type 1 " within context-free grammars controlled by regular sets in the language case. We show that the class which is the formal power series analogue of controlled free derivations forms a semiring containing the semiring of algebraic series, which in turn is characterized by the formal power series analogue of controlled leftmost derivations of type 1. 1
Citations
| 150 | Automata-theoretic aspects of formal power series – Salomaa, Soittola - 1978 |
| 92 | Regulated Rewriting in Formal Language Theory – Paun - 1989 |
| 68 | Algebraic Approaches to Program Semantics – Manes, Arbib - 1986 |
| 28 | Universal Algebra for Computer Scientists, volume 25 – Wechler - 1992 |
| 21 | Rational Series and Their Languages, volume 12 – Berstel, Reutenauer - 1988 |
| 11 | Semirings and formal power series – Kuich - 1997 |
| 10 | Grammars with controlled derivations – Paun - 1997 |
| 8 | Control sets on grammars – Ginsburg, Spanier - 1968 |
| 2 | Regulated grammars with leftmost derivation – Fernau - 1998 |
