Skip to main content
Conference Proceedings

On the regularity problem of SF-languages generated by minimal linear grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1981) 117 LNCS 244-249
DOI: 10.1007/3-540-10854-8_27
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Linna, M. (1981). On the regularity problem of SF-languages generated by minimal linear grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 117 LNCS, pp. 244–249). Springer Verlag. https://doi.org/10.1007/3-540-10854-8_27

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