Simplified Simple H Systems

Kamala Krithivasan () and Arvind Arasu
Additional contact information
Kamala Krithivasan: Indian Institute of Technology, Department of Computer Science and Engineering
Arvind Arasu: Indian Institute of Technology, Department of Computer Science and Engineering

Chapter Chapter 33 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 377-386 from Springer

Abstract: Abstract In this paper we define restricted versions of simple H systems of type (1,3) and (1,4) and show that the generative power is not decreased by this restriction. In the case of these systems the power is not increased by having a target alphabet whereas having permitting context increases the power.

Keywords: Restricted Version; Finite State Automaton; Discrete Apply Mathematic; Formal Language Theory; Nonterminal Symbol (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_33

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

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

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