论文信息 - Aperiodic Languages and Generalizations

Aperiodic Languages and Generalizations

For every integer k ≥ 0, a class of languages, called kaperiodic languages, is defined, generalizing the class of aperiodic languages. Properties of these classes are investigated, in particular the operations under which they are preserved. A characterization of the syntactic monoid of a kaperiodic language is also obtained.

Lila Kari | Gabriel Thierrin | L. Kari | G. Thierrin

[1] Lila Kari,et al. On Insertion and Deletion in Formal Languages , 1991 .

[2] Lila Kari,et al. Insertion and Deletion of Words: Determinism and Reversibility , 1992, MFCS.

[3] Karel Culik,et al. Classification of Noncounting Events , 1971, J. Comput. Syst. Sci..

[4] H. Shyr. Free monoids and languages , 1979 .

[5] Raymond E. Miller,et al. Varieties of Formal Languages , 1986 .

[6] G. Lallement. Semigroups and combinatorial applications , 1979 .

[7] R. McNaughton,et al. Counter-Free Automata , 1971 .