Regularly Controlled Formal Power Series

Henning Fernau () and Werner Kuich ()
Additional contact information
Henning Fernau: University of Tübingen, Wilhelm-Schickard Institute of Informatics
Werner Kuich: Technical University of Wien, Institute of Algebra and Computer Mathematics, Theoretical Informatics

Chapter Chapter 23 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 253-265 from Springer

Abstract: Abstract Regulated rewriting is one of the classical topics in formal language theory, see [3, 2]. This paper starts the research of regulated rewriting in the framework of formal power series, cf. [6, 7, 9]. More specifically, 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.

Keywords: Power Series; Formal Power Series; Closure Property; Control Word; Approximation Sequence (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_23

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_23

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().