A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Characterizations of regularity
Tekijät: Harju T
Julkaisuvuosi: 2006
Lehti:: Lecture Notes in Computer Science
Tietokannassa oleva lehden nimi: Finite-State Methods and Natural Language Processing
Lehden akronyymi: LECT NOTES COMPUT SC
Vuosikerta: 4002
Aloitussivu: 1
Lopetussivu: 8
Sivujen määrä: 8
ISBN: 978-3-540-35467-3
ISSN: 0302-9743
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali