References

  1. Jon M. Corson (2005): Extended finite automata and word problems. International Journal of Algebra and Computation 15(03), pp. 455–466, doi:10.1016/0022-0000(83)90003-X.
  2. Mario Curzio, Patrizia Longobardi & Mercede Maj (1983): Su di un problema combinatorio in teoria dei gruppi. Atti della Accademia Nazionale dei Lincei. 74(3), pp. 136–142.
  3. Jürgen Dassow & Victor Mitrana (2000): Finite automata over free groups. International Journal of Algebra and Computation 10(06), pp. 725–737, doi:10.1016/S0218-1967(00)00031-5.
  4. Aldo de Luca & Stefano Varricchio (1999): Finiteness and Regularity in Semigroups and Formal Languages. Springer-Verlag New York, Inc., doi:10.1007/978-3-642-59849-4.
  5. Henning Fernau & Ralf Stiebe (2001): Valence grammars with target sets.. In: Words, Semigroups, and Transductions, pp. 129–140, doi:10.1142/9789812810908_0010.
  6. Henning Fernau & Ralf Stiebe (2002): Sequential grammars and automata with valences. Theoretical Computer Science 276(1–2), pp. 377 – 405, doi:10.1016/S0304-3975(01)00282-1.
  7. Robert H. Gilman (1996): Formal languages and infinite groups. Geometric and computational perspectives on infinite groups, pp. 27–51.
  8. Sheila A. Greibach (1978): Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Science 7, pp. 311–324, doi:10.1016/0304-3975(78)90020-8.
  9. John M. Howie (1995): Fundamentals of Semigroup Theory. Clarendon Oxford.
  10. Oscar H. Ibarra, Sartaj K. Sahni & Chul E. Kim (1976): Finite automata with multiplication. Theoretical Computer Science 2(3), pp. 271 – 294, doi:10.1016/0304-3975(76)90081-5.
  11. Oscar H. Ibarra & Shinnosuke Seki (2015): Semilinear sets and counter machines: A brief survey. Fundamenta Informaticae 138(1-2), pp. 61–76.
  12. Mark Kambites (2006): Word problems recognisable by deterministic blind monoid automata. Theoretical Computer Science 362(1), pp. 232–237, doi:10.1016/j.tcs.2006.06.026.
  13. Mark Kambites (2009): Formal languages and groups as memory. Communications in Algebra 37(1), pp. 193–208, doi:10.1016/0022-0000(83)90003-X.
  14. Gerard Lallement (1979): Semigroups and Combinatorial Applications. John Wiley & Sons, Inc..
  15. Victor Mitrana & Ralf Stiebe (1997): The accepting power of finite automata over groups. In: New Trends in Formal Languages. Springer-Verlag, pp. 39–48, doi:10.1007/3-540-62844-4_4.
  16. Victor Mitrana & Ralf Stiebe (2001): Extended finite automata over groups. Discrete Applied Mathematics 108(3), pp. 287–300, doi:10.1016/S0166-218X(00)00200-6.
  17. Maurice Nivat (1970): Sur les automates a mémoire pile. In: Proc. of International Computing Symposium, pp. 221–225.
  18. Maurice Nivat & Jean-François Perrot (1970): Une généralisation du monoïde bicyclique. Comptes Rendus de l’Académie des Sciences de Paris 271, pp. 824–827.
  19. Jan Okniński (1991): Semigroup Algebras. Dekker.
  20. Gheorghe Păun (1980): A new generative device: Valence grammars. Rev. Roumaine Math. Pures Appl. 25(6), pp. 911–924.
  21. Elaine Render (2010): Rational Monoid and Semigroup Automata. University of Manchester.
  22. Elaine Render & Mark Kambites (2010): Semigroup automata with rational initial and terminal sets. Theor. Comput. Sci. 411(7-9), pp. 1004–1012, doi:10.1016/j.tcs.2009.11.007.
  23. Antonio Restivo & Christophe Reutenauer (1984): On the Burnside problem for semigroups. Journal of Algebra 89(1), pp. 102 – 104, doi:10.1016/0021-8693(84)90237-0.
  24. Georg Zetzsche (2011): On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids. In: Luca Aceto, Monika Henzinger & Jiří Sgall: Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 222–233, doi:10.1007/978-3-642-22012-8_17.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org