| [1] | Magnus Steinby, Eija Jurvanen, and Antonio Cano. Varieties of regular algebras and unranked tree languages. Discuss. Math. Gen. Algebra Appl., 36(2):179--208, 2016. [ DOI | Full text ] |
| [2] | J. Almeida, A. Cano, O. Klíma, and J.-É. Pin. On fixed points of the lower set operator. Internat. J. Algebra Comput., 25(1-2):259--292, 2015. [ DOI | Full text ] |
| [3] | Antonio Cano, Giovanna Guaiana, and Jean-Éric Pin. Regular languages and partial commutations. Inform. and Comput., 230:76--96, 2013. [ DOI | Full text ] |
| [4] | Antonio Cano and Jean-Éric Pin. Upper set monoids and length preserving morphisms. J. Pure Appl. Algebra, 216(5):1178--1183, 2012. [ DOI | Full text ] |
| [5] | Antonio Cano Gomez and Magnus Steinby. Generalized contexts and n-ary syntactic semigroups of tree languages. Asian-Eur. J. Math., 4(1):49--79, 2011. [ DOI | Full text ] |
| [6] | Pedro García, Manuel Vázquez de Parga, Antonio Cano, and Damián López. On locally reversible languages. Theoret. Comput. Sci., 410(47-49):4961--4974, 2009. [ DOI | Full text ] |
| [7] | Antonio Cano Gómez, Giovanna Guaiana, and Jean-Éric Pin. When does partial commutative closure preserve regularity? In Automata, languages and programming. Part II, volume 5126 of Lecture Notes in Comput. Sci., pages 209--220. Springer, Berlin, 2008. [ DOI | Full text ] |
| [8] | Antonio Cano Gómez and Jean-Éric Pin. A robust class of regular languages. In Mathematical foundations of computer science 2008, volume 5162 of Lecture Notes in Comput. Sci., pages 36--51. Springer, Berlin, 2008. [ DOI | Full text ] |
| [9] | Antonio Cano and Pedro García. Finite automata and unions of regular patterns with bounded constant segments. In Implementation and application of automata, volume 3845 of Lecture Notes in Comput. Sci., pages 104--115. Springer, Berlin, 2006. [ DOI | Full text ] |
| [10] | Antonio Cano Gómez and Jean-Éric Pin. Shuffle on positive varieties of languages. Theoret. Comput. Sci., 312(2-3):433--461, 2004. [ DOI | Full text ] |
| [11] | Antonio Cano Gómez and Jean-Éric Pin. On a conjecture of Schnoebelen. In Developments in language theory, volume 2710 of Lecture Notes in Comput. Sci., pages 35--54. Springer, Berlin, 2003. [ DOI | Full text ] |
| [12] | Antonio Cano, José Ruiz, and Pedro García. Inferring subclasses of regular languages faster using RPNI and forbidden configurations. In Grammatical inference: algorithms and applications, volume 2484 of Lecture Notes in Comput. Sci., pages 28--36. Springer, Berlin, 2002. [ DOI | Full text ] |
This file was generated by bibtex2html 1.99.