Théorie des magmoïdes (I)
RAIRO. Inform. théor., 12 3 (1978) 235-257
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Linear context-free tree languages and inverse homomorphisms
Johannes Osterholzer, Toni Dietze and Luisa HerrmannInformation and Computation 269 104454 (2019)
https://doi.org/10.1016/j.ic.2019.104454
Fuzzy graphs: algebraic structure and syntactic recognition
Antonios Kalampakas, Stefanos Spartalis, Lazaros Iliadis and Elias PimenidisArtificial Intelligence Review 42 (3) 479 (2014)
https://doi.org/10.1007/s10462-013-9412-0
MINIMIZATION OF PLANAR DIRECTED ACYCLIC GRAPH ALGEBRAS
ANTONIOS KALAMPAKAS and OLYMPIA LOUSCOU-BOZAPALIDOUInternational Journal of Foundations of Computer Science 24 (04) 519 (2013)
https://doi.org/10.1142/S0129054113500184
Syntactic recognizability of graphs with fuzzy attributes
Antonios Kalampakas, Stefanos Spartalis and Lazaros IliadisFuzzy Sets and Systems 229 91 (2013)
https://doi.org/10.1016/j.fss.2013.04.015
Artificial Intelligence Applications and Innovations
Antonios Kalampakas, Stefanos Spartalis and Lazaros IliadisIFIP Advances in Information and Communication Technology, Artificial Intelligence Applications and Innovations 381 196 (2012)
https://doi.org/10.1007/978-3-642-33409-2_21
Algebraic Foundations in Computer Science
Antonios KalampakasLecture Notes in Computer Science, Algebraic Foundations in Computer Science 7020 168 (2011)
https://doi.org/10.1007/978-3-642-24897-9_8
Graph automata
Symeon Bozapalidis and Antonios KalampakasTheoretical Computer Science 393 (1-3) 147 (2008)
https://doi.org/10.1016/j.tcs.2007.11.022
Algebraic Informatics
Antonios KalampakasLecture Notes in Computer Science, Algebraic Informatics 4728 208 (2007)
https://doi.org/10.1007/978-3-540-75414-5_13
Recognizability of graph and pattern languages
Symeon Bozapalidis and Antonios KalampakasActa Informatica 42 (8-9) 553 (2006)
https://doi.org/10.1007/s00236-006-0006-z
An axiomatization of graphs
Symeon Bozapalidis and Antonios KalampakasActa Informatica 41 (1) 19 (2004)
https://doi.org/10.1007/s00236-004-0149-8
Discrete Mathematics and Theoretical Computer Science
Symeon Bozapalidis and Antonios KalampakasLecture Notes in Computer Science, Discrete Mathematics and Theoretical Computer Science 2731 118 (2003)
https://doi.org/10.1007/3-540-45066-1_9
Handbook of Formal Languages
Ferenc Gécseg and Magnus SteinbyHandbook of Formal Languages 1 (1997)
https://doi.org/10.1007/978-3-642-59126-6_1
An algebraic model of synchronous systems
Miklós BarthaInformation and Computation 97 (1) 97 (1992)
https://doi.org/10.1016/0890-5401(92)90006-2
A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
Virgil-Emil Căzănescu and Gheorghe ŞtefănescuTheoretical Computer Science 99 (1) 1 (1992)
https://doi.org/10.1016/0304-3975(92)90171-B
LATIN '92
F. Bossut and B. WarinLecture Notes in Computer Science, LATIN '92 583 76 (1992)
https://doi.org/10.1007/BFb0023819
Foundations of a theory of synchronous systems
Miklós BarthaTheoretical Computer Science 100 (2) 325 (1992)
https://doi.org/10.1016/0304-3975(92)90307-2
On a code problem concerning planar acyclic graphs
F. Bossut and B. WarinRAIRO - Theoretical Informatics and Applications 25 (3) 205 (1991)
https://doi.org/10.1051/ita/1991250302051
Fundamentals of Computation Theory
Jean-Luc Coquidé, Max Dauchet and Sophie TisonLecture Notes in Computer Science, Fundamentals of Computation Theory 380 105 (1989)
https://doi.org/10.1007/3-540-51498-8_10
Fundamentals of Computation Theory
Miklós BarthaLecture Notes in Computer Science, Fundamentals of Computation Theory 380 25 (1989)
https://doi.org/10.1007/3-540-51498-8_3
Mathematical Foundations of Computer Science 1988
Francis Bossut, Max Dauchet and Bruno WarinLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1988 324 190 (1988)
https://doi.org/10.1007/BFb0017142
Graph-Grammars and Their Application to Computer Science
Bruno CourcelleLecture Notes in Computer Science, Graph-Grammars and Their Application to Computer Science 291 112 (1987)
https://doi.org/10.1007/3-540-18771-5_49
Graph expressions and graph rewritings
Michel Bauderon and Bruno CourcelleMathematical Systems Theory 20 (1) 83 (1987)
https://doi.org/10.1007/BF01692060
Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes
Patrice NaudinRAIRO - Theoretical Informatics and Applications 21 (1) 59 (1987)
https://doi.org/10.1051/ita/1987210100591
An equational axiomatization of systolic systems
Miklós BarthaTheoretical Computer Science 55 (2-3) 265 (1987)
https://doi.org/10.1016/0304-3975(87)90104-6
Functional behavior of nondeterministic and concurrent programs
Michael G. Main and David B. BensonInformation and Control 62 (2-3) 144 (1984)
https://doi.org/10.1016/S0019-9958(84)80032-7
Fundamental properties of infinite trees
Bruno CourcelleTheoretical Computer Science 25 (2) 95 (1983)
https://doi.org/10.1016/0304-3975(83)90059-2
An extension to trees of the Sardinas and Patterson algorithm
Paul Franchi-ZannettacciInformation Processing Letters 14 (4) 168 (1982)
https://doi.org/10.1016/0020-0190(82)90030-8
Theoretical Foundations of Programming Methodology
Bruno CourcelleTheoretical Foundations of Programming Methodology 417 (1982)
https://doi.org/10.1007/978-94-009-7893-5_13
Morphismes et bimorphismes d'arbres
A. Arnold and M. DauchetTheoretical Computer Science 20 (1) 33 (1982)
https://doi.org/10.1016/0304-3975(82)90098-6
CAAP '81
Eric LilinLecture Notes in Computer Science, CAAP '81 112 280 (1981)
https://doi.org/10.1007/3-540-10828-9_69
Fundamentals of Computation Theory
B. LeguyLecture Notes in Computer Science, Fundamentals of Computation Theory 117 226 (1981)
https://doi.org/10.1007/3-540-10854-8_25
Transducteurs finis d'arbres et tests d'égalité
E. LilinRAIRO. Informatique théorique 15 (3) 213 (1981)
https://doi.org/10.1051/ita/1981150302131
CAAP '81
Bernard LeguyLecture Notes in Computer Science, CAAP '81 112 268 (1981)
https://doi.org/10.1007/3-540-10828-9_68
Une propri\'et\'e des forêts alg\'ebriques « de greibach \ra
Andr\'e Arnold and Bernard LeguyInformation and Control 46 (2) 108 (1980)
https://doi.org/10.1016/S0019-9958(80)90698-1