Semi-Simple Splicing Systems

Elizabeth Goode () and Dennis Pixton ()
Additional contact information
Elizabeth Goode: University of Delaware, Department of Computer and Information Sciences
Dennis Pixton: Binghamton University, Department of Mathematics

Chapter Chapter 30 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 343-352 from Springer

Abstract: Abstract Generalizing a notion introduced by Păun and his coworkers, we introduce semi-simple splicing systems, in which all splicing rules have the form (a, 1; b,1) where a and b are single symbols. We find a simple graph representation of these systems, and from this representation we show that semi-simple splicing languages are reflexive splicing languages, that they contain constants, and that they are, in fact, strictly locally testable.

Keywords: Regular Language; Terminal Vertex; Approximate Factorization; Discrete Apply Mathematic; Formal Language Theory (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_30

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

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

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