Name
Abstract | ||
|---|---|---|
The framework of C-varieties, introduced by the third author, extends the scope of Eilenberg's variety theory to new classes of languages. In this paper, we first define C-varieties of actions, which are closely related to automata, and prove their equivalence with the original definition of C-varieties of stamps. Next, we complete the study of the wreath product initiated by Ésik and Ito by extending its definition to C-varieties in two different ways, which are proved to be equivalent. We also state an extension of the wreath product principle, a standard tool of language theory. Finally, our main result generalizes to C-varieties the algebraic characterization of the closure under product of a variety of languages. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.tcs.2006.01.039 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
original definition,different way,Wreath product,Varieties of recognizable languages,concatenation product,standard tool,new class,Finite automata,variety theory,language theory,wreath product principle,wreath product,main result generalizes,algebraic characterization | Journal | 356 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science | 14 |
PageRank | References | Authors |
0.73 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laura Chaubard | 1 | 97 | 5.96 |
| Jean-Éric Pin | 2 | 112 | 10.57 |
| Howard Straubing | 3 | 528 | 60.92 |