Représentations matricielles des séries d'arbre reconnaissables
RAIRO-Theor. Inf. Appl., 23 4 (1989) 449-459
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):
The weighted HOM-problem over fields
Andreea-Teodora NászJournal of Computer and System Sciences 149 103616 (2025)
https://doi.org/10.1016/j.jcss.2024.103616
14519 427 (2024)
https://doi.org/10.1007/978-3-031-52113-3_30
Foundations of Software Science and Computation Structures
Stefan Kiefer, Ines Marusic and James WorrellLecture Notes in Computer Science, Foundations of Software Science and Computation Structures 9034 297 (2015)
https://doi.org/10.1007/978-3-662-46678-0_19
Mathematical Foundations of Computer Science 2014
Ines Marusic and James WorrellLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2014 8634 414 (2014)
https://doi.org/10.1007/978-3-662-44522-8_35
Equational weighted tree transformations
Symeon Bozapalidis, Zoltán Fülöp and George RahonisActa Informatica 49 (1) 29 (2012)
https://doi.org/10.1007/s00236-011-0148-5
Varieties of recognizable tree series over fields
Zoltán Fülöp and Magnus SteinbyTheoretical Computer Science 412 (8-10) 736 (2011)
https://doi.org/10.1016/j.tcs.2010.11.018
Algebraic Foundations in Computer Science
Manfred Droste, Doreen Götze, Steffen Märcker and Ingmar MeineckeLecture Notes in Computer Science, Algebraic Foundations in Computer Science 7020 30 (2011)
https://doi.org/10.1007/978-3-642-24897-9_2
Algebraic Foundations in Computer Science
Ina Fichtner and Christian MathissenLecture Notes in Computer Science, Algebraic Foundations in Computer Science 7020 94 (2011)
https://doi.org/10.1007/978-3-642-24897-9_5
On the syntactic complexity of tree series
Symeon Bozapalidis and Antonios KalampakasRAIRO - Theoretical Informatics and Applications 44 (2) 257 (2010)
https://doi.org/10.1051/ita/2010014
Definable transductions and weighted logics for texts
Christian MathissenTheoretical Computer Science 411 (3) 631 (2010)
https://doi.org/10.1016/j.tcs.2009.09.040
Handbook of Weighted Automata
Zoltán Fülöp and Heiko VoglerMonographs in Theoretical Computer Science, Handbook of Weighted Automata 313 (2009)
https://doi.org/10.1007/978-3-642-01492-5_9
Developments in Language Theory
Christian MathissenLecture Notes in Computer Science, Developments in Language Theory 4588 324 (2007)
https://doi.org/10.1007/978-3-540-73208-2_31
Cut sets as recognizable tree languages
Björn Borchardt, Andreas Maletti, Branimir Šešelja, Andreja Tepavčević and Heiko VoglerFuzzy Sets and Systems 157 (11) 1560 (2006)
https://doi.org/10.1016/j.fss.2005.11.004
Unconventional Models of Computation, UMC’2K
Symeon BozapalidisUnconventional Models of Computation, UMC’2K 25 (2001)
https://doi.org/10.1007/978-1-4471-0313-4_3
Context-Free Series on Trees
Symeon BozapalidisInformation and Computation 169 (2) 186 (2001)
https://doi.org/10.1006/inco.2001.2890
Recognizable Formal Series on Trees and Cofree Coalgebraic Systems
Richard E Block and Gary GriffingJournal of Algebra 215 (2) 543 (1999)
https://doi.org/10.1006/jabr.1998.7752
Positive Tree Representations and Applications to Tree Automata
Symeon BozapalidisInformation and Computation 139 (2) 130 (1997)
https://doi.org/10.1006/inco.1997.2667
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
On two families of forests
Symeon Bozapalidis and George RahonisActa Informatica 31 (3) 235 (1994)
https://doi.org/10.1007/BF01218405
Effective construction of the syntactic algebra of a recognizable series on trees
Symeon BozapalidisActa Informatica 28 (4) 351 (1991)
https://doi.org/10.1007/BF01893886
Varieties of formal series on trees and Eilenberg's theorem
Symeon Bozapalidis and Stavros IoulidisInformation Processing Letters 29 (4) 171 (1988)
https://doi.org/10.1016/0020-0190(88)90056-7