Editing Syntactic monoid (section)

==References==
{{Reflist}}
* {{cite book | last=Anderson | first=James A. | title=Automata theory with modern applications | others=With contributions by Tom Head | location=Cambridge | publisher=[[Cambridge University Press]] | year=2006 | isbn=0-521-61324-8 | zbl=1127.68049 }}
* {{cite book | last=Holcombe | first=W.M.L. | title=Algebraic automata theory | zbl=0489.68046 | series=Cambridge Studies in Advanced Mathematics | volume=1 | publisher=[[Cambridge University Press]] | year=1982 | isbn=0-521-60492-3 }}
* {{cite book | last=Lawson | first=Mark V. | title=Finite automata | publisher=Chapman and Hall/CRC | year=2004 | isbn=1-58488-255-7 | zbl=1086.68074 }}
* {{cite book | editor1-last=Rozenberg | editor1-first=G. | editor2-last=Salomaa | editor2-first=A. | first=Jean-Éric | last=Pin |author-link = Jean-Éric Pin| url=http://www.liafa.jussieu.fr/~jep/PDF/HandBook.pdf | chapter=10. Syntactic semigroups | title=Handbook of Formal Language Theory | volume=1 | publisher=[[Springer-Verlag]] | year=1997 | pages=679–746 | zbl=0866.68057 }}
* {{cite book | last=Sakarovitch | first=Jacques | title=Elements of automata theory | others=Translated from the French by Reuben Thomas | publisher=[[Cambridge University Press]] | year=2009 | isbn=978-0-521-84425-3 | zbl=1188.68177 }}
* {{cite book | last=Straubing | first=Howard | title=Finite automata, formal logic, and circuit complexity | url=https://archive.org/details/finiteautomatafo0000stra | url-access=registration | series=Progress in Theoretical Computer Science | location=Basel | publisher=Birkhäuser | year=1994 | isbn=3-7643-3719-2 | zbl=0816.68086 }}

[[Category:Formal languages]]
[[Category:Semigroup theory]]