Skip to main content
Conference ProceedingsOPEN ACCESS

A new characterization of the regular languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1981) 115 LNCS 177-183
DOI: 10.1007/3-540-10843-2_14
5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We define weakly commutative languages and periodic languages. We show that a language is regular if and only if it is simultaneously weakly commutative and periodic.

Cite

CITATION STYLE

APA

Reutenauer, C. (1981). A new characterization of the regular languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 115 LNCS, pp. 177–183). Springer Verlag. https://doi.org/10.1007/3-540-10843-2_14

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