Subregularly Controlled Derivations: Restrictions by Syntactic Parameters

Jürgen Dassow ()
Additional contact information
Jürgen Dassow: Otto-von-Guericke- University Magdeburg, Department of Computer Science, Faculty of Informatics

Chapter Chapter 5 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 51-61 from Springer

Abstract: Abstract We consider regularly controlled context-free grammars and restrict the number of nonterminals or productions which are necessary to generate the regular control language. We investigate the hierarchies with respect to these parameters. Moreover, we compare the succinctness of the description of regular languages by regular grammars (without control) and regular grammars with regular control.

Keywords: Normal Form; Regular Language; Minimal Complexity; Sentential Form; Control 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_5

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

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

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