Characterizations of regularity

: Harju T

: 2006

Lecture Notes in Computer Science

Finite-State Methods and Natural Language Processing

: LECT NOTES COMPUT SC

: 4002

: 1

: 8

: 978-3-540-35467-3

: 0302-9743

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.

Mathematics