论文信息 - Classifying Regular Languages by their Syntactic Algebras - 字舞流文

Classifying Regular Languages by their Syntactic Algebras

Magnus Steinby | M. Steinby

[1] Denis Thérien,et al. Recognizable languages and congruences , 1981 .

[2] Julius Richard Büchi,et al. Finite automata, their algebras and grammars - towards a theory of formal expressions , 1989 .

[3] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[4] Wolfgang Wechler,et al. Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.

[5] George Gratzer,et al. Universal Algebra , 1979 .

[6] Stanley Burris,et al. A course in universal algebra , 1981, Graduate texts in mathematics.

[7] Andreas Podelski,et al. Tree Automata and Languages , 1992 .

[8] John M. Howie,et al. Automata and languages , 1991 .

[9] Denis Therien,et al. Classification of regular languages by congruences , 1980 .

[10] Ján Cerný,et al. On directable automata , 1971, Kybernetika (Praha).

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

[12] Jorge Almeida. On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics , 1990 .

[13] Magnus Steinby. A theory of tree language varieties , 1992, Tree Automata and Languages.

[14] Dirk Siefkes,et al. Finite Automata, Their Algebras and Grammars , 1990 .

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