Frontiers of infinite trees
RAIRO. Inform. théor., 12 4 (1978) 319-337
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 ordinal generated by an ordinal grammar is computable
Kitti Gelle and Szabolcs IvánTheoretical Computer Science 793 1 (2019)
https://doi.org/10.1016/j.tcs.2019.04.016
Descriptional Complexity of Formal Systems
Zoltán Ésik and Szabolcs IvánLecture Notes in Computer Science, Descriptional Complexity of Formal Systems 9777 87 (2016)
https://doi.org/10.1007/978-3-319-41114-9_7
On Müller context-free grammars
Zoltán Ésik and Szabolcs IvánTheoretical Computer Science 416 17 (2012)
https://doi.org/10.1016/j.tcs.2011.10.012
ORDINAL AUTOMATA AND CANTOR NORMAL FORM
ZOLTÁN ÉSIKInternational Journal of Foundations of Computer Science 23 (01) 87 (2012)
https://doi.org/10.1142/S0129054112400060
Automata, Languages and Programming
Markus Lohrey and Christian MathissenLecture Notes in Computer Science, Automata, Languages and Programming 6756 210 (2011)
https://doi.org/10.1007/978-3-642-22012-8_16
Büchi context-free languages
Zoltán Ésik and Szabolcs IvánTheoretical Computer Science 412 (8-10) 805 (2011)
https://doi.org/10.1016/j.tcs.2010.11.026
A Mezei–Wright theorem for categorical algebras
S.L. Bloom and Z. ÉsikTheoretical Computer Science 411 (2) 341 (2010)
https://doi.org/10.1016/j.tcs.2009.06.040
Developments in Language Theory
Zoltán Ésik and Szabolcs IvánLecture Notes in Computer Science, Developments in Language Theory 6224 173 (2010)
https://doi.org/10.1007/978-3-642-14455-4_17
Tree Automata and Automata on Linear Orderings
Véronique Bruyère, Olivier Carton and Géraud SénizerguesRAIRO - Theoretical Informatics and Applications 43 (2) 321 (2009)
https://doi.org/10.1051/ita/2009009
Theoretical Aspects of Computing - ICTAC 2009
Zoltán Ésik and Szabolcs IvánLecture Notes in Computer Science, Theoretical Aspects of Computing - ICTAC 2009 5684 185 (2009)
https://doi.org/10.1007/978-3-642-03466-4_12
Algebra and Coalgebra in Computer Science
S. L. Bloom and Z. ÉsikLecture Notes in Computer Science, Algebra and Coalgebra in Computer Science 4624 1 (2007)
https://doi.org/10.1007/978-3-540-73859-6_1
Automata on linear orderings
Véronique Bruyère and Olivier CartonJournal of Computer and System Sciences 73 (1) 1 (2007)
https://doi.org/10.1016/j.jcss.2006.10.009
A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
ALEXIS BÈS and OLIVIER CARTONInternational Journal of Foundations of Computer Science 17 (03) 519 (2006)
https://doi.org/10.1142/S0129054106003978
Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006
Stephen L. Bloom and Zoltán ÉsikIFIP International Federation for Information Processing, Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006 209 231 (2006)
https://doi.org/10.1007/978-0-387-34735-6_20
Developments in Language Theory
Alexis Bès and Olivier CartonLecture Notes in Computer Science, Developments in Language Theory 3572 158 (2005)
https://doi.org/10.1007/11505877_14
The equational theory of regular words
Stephen L. Bloom and Zoltán ÉsikInformation and Computation 197 (1-2) 55 (2005)
https://doi.org/10.1016/j.ic.2005.01.004
Clique-width of countable graphs: a compactness property
B. CourcelleDiscrete Mathematics 276 (1-3) 127 (2004)
https://doi.org/10.1016/S0012-365X(03)00303-0
Infinite Words - Automata, Semigroups, Logic and Games
Pure and Applied Mathematics, Infinite Words - Automata, Semigroups, Logic and Games 141 499 (2004)https://doi.org/10.1016/S0079-8169(04)80014-X
Developments in Language Theory
Véronique Bruyère and Olivier CartonLecture Notes in Computer Science, Developments in Language Theory 2450 103 (2003)
https://doi.org/10.1007/3-540-45005-X_9
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Stephen L. Bloom and Zoltán ÉsikLecture Notes in Computer Science, FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science 2914 50 (2003)
https://doi.org/10.1007/978-3-540-24597-1_5
Mathematical Foundations of Computer Science 2001
Véronique Bruyère and Olivier CartonLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2001 2136 236 (2001)
https://doi.org/10.1007/3-540-44683-4_21
Infinite hypergraphs I. Basic properties
Michael BauderonTheoretical Computer Science 82 (2) 177 (1991)
https://doi.org/10.1016/0304-3975(91)90222-N
Graph-Theoretic Concepts in Computer Science
Michel BauderonLecture Notes in Computer Science, Graph-Theoretic Concepts in Computer Science 344 54 (1989)
https://doi.org/10.1007/3-540-50728-0_35
On frontiers of regular trees
Wolfgang ThomasRAIRO - Theoretical Informatics and Applications 20 (4) 371 (1986)
https://doi.org/10.1051/ita/1986200403711
Continuous monoids and yields of infinite trees
M. Dauchet and E. TimmermanRAIRO - Theoretical Informatics and Applications 20 (3) 251 (1986)
https://doi.org/10.1051/ita/1986200302511
Automata on Infinite Words
Max Dauchet and Erick TimmermanLecture Notes in Computer Science, Automata on Infinite Words 192 118 (1985)
https://doi.org/10.1007/3-540-15641-0_29
Fundamental properties of infinite trees
Bruno CourcelleTheoretical Computer Science 25 (2) 95 (1983)
https://doi.org/10.1016/0304-3975(83)90059-2
Theoretical Foundations of Programming Methodology
Maurice NivatTheoretical Foundations of Programming Methodology 473 (1982)
https://doi.org/10.1007/978-94-009-7893-5_14
Theoretical Foundations of Programming Methodology
Bruno CourcelleTheoretical Foundations of Programming Methodology 417 (1982)
https://doi.org/10.1007/978-94-009-7893-5_13
Fundamentals of Computation Theory
Axel PoignéLecture Notes in Computer Science, Fundamentals of Computation Theory 117 301 (1981)
https://doi.org/10.1007/3-540-10854-8_33
An algorithm for the solution of fixed-point equations for infinite words
Stephan HeilbrunnerRAIRO. Informatique théorique 14 (2) 131 (1980)
https://doi.org/10.1051/ita/1980140201311