Skip to main content
Conference Proceedings

Characterizations of regularity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4002 LNAI 1-8
DOI: 10.1007/11780885_1
0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Regular languages have many different characterizations in terms of automata, congruences, semigroups etc. We have a look at some more recent results, obtained mostly during the last two decades, namely characterizations using morphic compositions, equality sets and well orderings.

Cite

CITATION STYLE

APA

Harju, T. (2006). Characterizations of regularity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4002 LNAI, pp. 1–8). Springer Verlag. https://doi.org/10.1007/11780885_1

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