From Rational Functions to Regular Languages

Elena Barcucci (), Alberto Del Lungo (), Andrea Frosini () and Simone Rinaldi ()
Additional contact information
Elena Barcucci: Dipartimento di Sistemi e Informatica
Alberto Del Lungo: Dipartimento di Matematica
Andrea Frosini: Dipartimento di Matematica
Simone Rinaldi: Dipartimento di Sistemi e Informatica

A chapter in Formal Power Series and Algebraic Combinatorics, 2000, pp 633-644 from Springer

Abstract: Abstract In this paper, we start out by giving a characterization of the set R of the generating functions of a regular language. We then propose two algorithms able to determine if a rational function f(x) lies in R and which provide an unambiguous regular language for f(x). We discuss an open problem regarding languages having a rational generating function.

Keywords: Regular Expression; Rational Series; Formal Power Series; Regular Language; Rational Operation (search for similar items in EconPapers)
Date: 2000
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-3-662-04166-6_62

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

DOI: 10.1007/978-3-662-04166-6_62

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 ().