A. Arnold and M. Dauchet, Théorie des magmoides. I. RAIRO Inform, Théor, vol.12, pp.235-257, 1978.

A. Arnold and M. Dauchet, Th??orie des magmo??des, RAIRO. Informatique th??orique, vol.13, issue.2, pp.135-154, 1979.
DOI : 10.1051/ita/1979130201351

C. Blume, Recognizable Graph Languages for the Verification of Dynamic Systems, LNCS, vol.6372, pp.384-387, 2010.
DOI : 10.1007/978-3-642-15928-2_27

C. Blume, S. Bruggink, and B. König, Recognizable Graph Languages for Checking Invariants. Workshop on Graph Transformation and Visual Modeling Techniques, Electronic Communications of the EASST, vol.29, 2010.
DOI : 10.1007/978-3-642-15928-2_27

S. Bozapalidis and O. L. Bozapalidou, On the recognizability of fuzzy languages I. Fuzzy Sets and Systems, pp.2394-2402, 2006.

S. Bozapalidis and O. L. Bozapalidou, On the recognizability of fuzzy languages II. Fuzzy Sets and Systems, pp.107-113, 2008.

S. Bozapalidis and O. L. Bozapalidou, Fuzzy tree language recognizability. Fuzzy Sets and Systems, pp.716-734, 2010.
DOI : 10.1016/j.fss.2009.08.008

S. Bozapalidis and A. Kalampakas, An axiomatization of graphs, Acta Informatica, vol.49, issue.1, pp.19-61, 2004.
DOI : 10.1007/s00236-004-0149-8

S. Bozapalidis and A. Kalampakas, Recognizability of graph and pattern languages, Acta Informatica, vol.11, issue.3, pp.553-581, 2006.
DOI : 10.1007/s00236-006-0006-z

S. Bozapalidis and A. Kalampakas, Graph automata, Theoretical Computer Science, vol.393, issue.1-3, pp.147-165, 2008.
DOI : 10.1016/j.tcs.2007.11.022
URL : http://doi.org/10.1016/j.tcs.2007.11.022

J. Brzozowski and Y. Ye, Syntactic Complexity of Ideal and Closed Languages, LNCS, vol.6795, p.117128, 2011.
DOI : 10.1007/978-3-642-22321-1_11

J. Brzozowski, B. Li, and Y. Ye, Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages, Theoretical Computer Science, vol.449, 2012.
DOI : 10.1016/j.tcs.2012.04.011

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765

J. Engelfriet and J. J. Vereijken, Context-free graph grammars and concatenation of graphs, Acta Informatica, vol.34, issue.10, pp.773-803, 1997.
DOI : 10.1007/s002360050106

A. Kalampakas, Graph Automata: The Algebraic Properties of Abelian Relational Graphoids, LNCS, vol.15, pp.168-182, 2011.
DOI : 10.1007/BF01786981

J. N. Mordeson and P. S. Nair, Fuzzy Graphs and Fuzzy Hypergraphs, 2000.
DOI : 10.1007/978-3-7908-1854-3

D. Quernheim and K. Knight, Towards Probabilistic Acceptors and Transducers for Feature Structures Semantics and Structure in Statistical Translation, Proc. 6th Workshop Syntax, 2012.

A. Rosenfeld, Fuzzy graphs, Fuzzy Sets and Their Applications to Cognitive and Decision Processes, p.7795, 1975.