Syntactic semigroups Export

@misc{citeulike:2775871, abstract = {Introduction This chapter gives an overview on what is often called the algebraic theory of finite automata. It deals with languages, automata and semigroups, and has connections with model theory in logic, boolean circuits, symbolic dynamics and topology. Kleene's theorem [70] is usually considered as the foundation of this theory. It shows that the class of recognizable languages (i.e. recognized by finite automata), coincides with the class of rational languages, which are given by...}, author = {Pin, J.}, citeulike-article-id = {2775871}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.1059}, keywords = {semigroups, syntactic}, posted-at = {2008-05-09 14:33:59}, priority = {2}, title = {Syntactic semigroups}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.1059}, year = {1997} }

TY - GEN ID - citeulike:2775871 L3 - citeulike-article-id:2775871 N2 - Introduction This chapter gives an overview on what is often called the algebraic theory of finite automata. It deals with languages, automata and semigroups, and has connections with model theory in logic, boolean circuits, symbolic dynamics and topology. Kleene's theorem [70] is usually considered as the foundation of this theory. It shows that the class of recognizable languages (i.e. recognized by finite automata), coincides with the class of rational languages, which are given by... TI - Syntactic semigroups KW - semigroups KW - syntactic AU - Pin, J PY - 1997/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.1059 ER -