A1 Refereed original research article in a scientific journal
Characterizations of regularity
Authors: Harju T
Publication year: 2006
Journal:: Lecture Notes in Computer Science
Journal name in source: Finite-State Methods and Natural Language Processing
Journal acronym: LECT NOTES COMPUT SC
Volume: 4002
First page : 1
Last page: 8
Number of pages: 8
ISBN: 978-3-540-35467-3
ISSN: 0302-9743
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.
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.