Skip to main content
Journal Article

On grammars controlled by parikh vectors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7300 LNAI 246-264
DOI: 10.1007/978-3-642-31644-9_17
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We suggest a concept of grammars with controlled derivations where the Parikh vectors of all intermediate sentential forms have to be from a given restricting set. For several classes of restricting sets, we investigate set-theoretic and closure properties of the corresponding language families. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Stiebe, R. (2012). On grammars controlled by parikh vectors. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7300 LNAI, 246–264. https://doi.org/10.1007/978-3-642-31644-9_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free