Semigroups and automata on infinite words Export

@misc{citeulike:2796146, abstract = {This paper is an introduction to the algebraic theory of infinite words. Infinite words are widely used in computer science, in particular to model the behaviour of programs or circuits. From a mathematical point of view, they have a rich structure, at the cross-roads of logic, topology and algebra. This paper emphasizes the combinatorial and algebraic aspects of this theory but the interested reader is referred to the survey articles [32,43] or to the report [30] for more information on the...}, author = {Perrin, D. and Pin, J.}, citeulike-article-id = {2796146}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/perrin95semigroups.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/perrin95semigroups.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/perrin95semigroups.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/perrin95semigroups.html}, keywords = {semigroups}, posted-at = {2008-05-13 22:50:58}, priority = {2}, title = {Semigroups and automata on infinite words}, url = {http://citeseer.ist.psu.edu/perrin95semigroups.html}, year = {1995} }

TY - GEN ID - citeulike:2796146 L3 - citeulike-article-id:2796146 N2 - This paper is an introduction to the algebraic theory of infinite words. Infinite words are widely used in computer science, in particular to model the behaviour of programs or circuits. From a mathematical point of view, they have a rich structure, at the cross-roads of logic, topology and algebra. This paper emphasizes the combinatorial and algebraic aspects of this theory but the interested reader is referred to the survey articles [32,43] or to the report [30] for more information on the... TI - Semigroups and automata on infinite words KW - semigroups AU - Perrin, D AU - Pin, J PY - 1995/// UR - http://citeseer.ist.psu.edu/perrin95semigroups.html ER -