A Characterization of Non-Iterated Splicing with Regular Rules

Ray Dassen, Hendrik Jan Hoogeboom () and Nikè van Vugt ()
Additional contact information
Ray Dassen: University of Leiden, Leiden Institute of Advanced Computer Science
Hendrik Jan Hoogeboom: University of Leiden, Leiden Institute of Advanced Computer Science
Nikè van Vugt: University of Leiden, Leiden Institute of Advanced Computer Science

Chapter Chapter 28 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 319-327 from Springer

Abstract: Abstract The family S(LIN, REG) of languages obtained by (noniterated) splicing linear languages using regular rules does not coincide with one of the Chomsky families. We give a characterization of this family, and show that we can replace the regular rule set by a finite one.

Keywords: Finite State Automaton; Formal Language Theory; Friendly Family; Splice System; Initial Language (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_28

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

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

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