Skip to main content
Conference Proceedings

On internal contextual grammars with subregular selection languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7386 LNCS 222-235
DOI: 10.1007/978-3-642-31623-4_17
5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we study the power of internal contextual grammars with selection languages from subfamilies of the family of regular languages. If we consider families which are obtained by restriction to n states or nonterminals or productions or symbols to accept or to generate regular languages, we obtain four infinite hierarchies of the corresponding families of languages generated by internal contextual grammars with selection languages in . © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Manea, F., & Truthe, B. (2012). On internal contextual grammars with subregular selection languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7386 LNCS, pp. 222–235). https://doi.org/10.1007/978-3-642-31623-4_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