First-order properties of trees, star-free expressions, and aperiodicity
RAIRO-Theor. Inf. Appl., 25 2 (1991) 125-145
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):
A Model Checker for Operator Precedence Languages
Michele Chiari, Dino Mandrioli, Francesco Pontiggia and Matteo PradellaACM Transactions on Programming Languages and Systems 45 (3) 1 (2023)
https://doi.org/10.1145/3608443
Operator precedence temporal logic and model checking
Michele Chiari, Dino Mandrioli and Matteo PradellaTheoretical Computer Science 848 47 (2020)
https://doi.org/10.1016/j.tcs.2020.08.034
Theoretical Aspects of Computing – ICTAC 2020
Dino Mandrioli, Matteo Pradella and Stefano Crespi ReghizziLecture Notes in Computer Science, Theoretical Aspects of Computing – ICTAC 2020 12545 161 (2020)
https://doi.org/10.1007/978-3-030-64276-1_9
ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES
ZOLTÁN ÉSIK and PASCAL WEILInternational Journal of Algebra and Computation 20 (02) 195 (2010)
https://doi.org/10.1142/S0218196710005595
Adjunct elimination in Context Logic for trees
Cristiano Calcagno, Thomas Dinsdale-Young and Philippa GardnerInformation and Computation 208 (5) 474 (2010)
https://doi.org/10.1016/j.ic.2009.02.013
Regular tree languages definable in FO and in FO mod
Michael Benedikt and Luc SegoufinACM Transactions on Computational Logic 11 (1) 1 (2009)
https://doi.org/10.1145/1614431.1614435
Algebraic Informatics
Zoltan Ésik and Szabolcs IvánLecture Notes in Computer Science, Algebraic Informatics 4728 189 (2007)
https://doi.org/10.1007/978-3-540-75414-5_12
Programming Languages and Systems
Cristiano Calcagno, Thomas Dinsdale-Young and Philippa GardnerLecture Notes in Computer Science, Programming Languages and Systems 4807 255 (2007)
https://doi.org/10.1007/978-3-540-76637-7_17
Structural Theory of Automata, Semigroups, and Universal Algebra
Magnus SteinbyNATO Science Series II: Mathematics, Physics and Chemistry, Structural Theory of Automata, Semigroups, and Universal Algebra 207 381 (2005)
https://doi.org/10.1007/1-4020-3817-8_13
STACS 2005
Michael Benedikt and Luc SegoufinLecture Notes in Computer Science, STACS 2005 3404 327 (2005)
https://doi.org/10.1007/978-3-540-31856-9_27
General varieties of tree languages
Magnus SteinbyTheoretical Computer Science 205 (1-2) 1 (1998)
https://doi.org/10.1016/S0304-3975(98)00010-3
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
TAPSOFT '95: Theory and Practice of Software Development
Andreas PotthoffLecture Notes in Computer Science, TAPSOFT '95: Theory and Practice of Software Development 915 123 (1995)
https://doi.org/10.1007/3-540-59293-8_191
Modulo-counting quantifiers over finite trees
Andreas PotthoffTheoretical Computer Science 126 (1) 97 (1994)
https://doi.org/10.1016/0304-3975(94)90270-4
Fundamentals of Computation Theory
Andreas Potthoff and Wolfgang ThomasLecture Notes in Computer Science, Fundamentals of Computation Theory 710 396 (1993)
https://doi.org/10.1007/3-540-57163-9_34
CAAP '92
Andreas PotthoffLecture Notes in Computer Science, CAAP '92 581 265 (1992)
https://doi.org/10.1007/3-540-55251-0_15
LATIN '92
F. Bossut and B. WarinLecture Notes in Computer Science, LATIN '92 583 76 (1992)
https://doi.org/10.1007/BFb0023819