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):

On frontiers of regular trees

Wolfgang Thomas
RAIRO - Theoretical Informatics and Applications 20 (4) 371 (1986)
DOI: 10.1051/ita/1986200403711
See this article

Tree Automata and Automata on Linear Orderings

Véronique Bruyère, Olivier Carton and Géraud Sénizergues
RAIRO - Theoretical Informatics and Applications 43 (2) 321 (2009)
DOI: 10.1051/ita/2009009
See this article

An algorithm for the solution of fixed-point equations for infinite words

Stephan Heilbrunner
RAIRO. Informatique théorique 14 (2) 131 (1980)
DOI: 10.1051/ita/1980140201311
See this article

A Mezei–Wright theorem for categorical algebras

S.L. Bloom and Z. Ésik
Theoretical Computer Science 411 (2) 341 (2010)
DOI: 10.1016/j.tcs.2009.06.040
See this article

On Müller context-free grammars

Zoltán Ésik and Szabolcs Iván
Theoretical Computer Science 416 17 (2012)
DOI: 10.1016/j.tcs.2011.10.012
See this article

Max Dauchet and Erick Timmerman
192 118 (1985)
DOI: 10.1007/3-540-15641-0_29
See this article

The equational theory of regular words

Stephen L. Bloom and Zoltán Ésik
Information and Computation 197 (1-2) 55 (2005)
DOI: 10.1016/j.ic.2005.01.004
See this article

Zoltán Ésik and Szabolcs Iván
5684 185 (2009)
DOI: 10.1007/978-3-642-03466-4_12
See this article

Automata on linear orderings

Véronique Bruyère and Olivier Carton
Journal of Computer and System Sciences 73 (1) 1 (2007)
DOI: 10.1016/j.jcss.2006.10.009
See this article

Véronique Bruyère and Olivier Carton
2450 103 (2003)
DOI: 10.1007/3-540-45005-X_9
See this article

Stephen L. Bloom and Zoltán Ésik
209 231 (2006)
DOI: 10.1007/978-0-387-34735-6_20
See this article

The ordinal generated by an ordinal grammar is computable

Kitti Gelle and Szabolcs Iván
Theoretical Computer Science 793 1 (2019)
DOI: 10.1016/j.tcs.2019.04.016
See this article

Stephen L. Bloom and Zoltán Ésik
2914 50 (2003)
DOI: 10.1007/978-3-540-24597-1_5
See this article

Véronique Bruyère and Olivier Carton
2136 236 (2001)
DOI: 10.1007/3-540-44683-4_21
See this article

Fundamental properties of infinite trees

Bruno Courcelle
Theoretical Computer Science 25 (2) 95 (1983)
DOI: 10.1016/0304-3975(83)90059-2
See this article

Alexis Bès and Olivier Carton
3572 158 (2005)
DOI: 10.1007/11505877_14
See this article

Zoltán Ésik and Szabolcs Iván
9777 87 (2016)
DOI: 10.1007/978-3-319-41114-9_7
See this article

ORDINAL AUTOMATA AND CANTOR NORMAL FORM

ZOLTÁN ÉSIK
International Journal of Foundations of Computer Science 23 (01) 87 (2012)
DOI: 10.1142/S0129054112400060
See this article

Zoltán Ésik and Szabolcs Iván
6224 173 (2010)
DOI: 10.1007/978-3-642-14455-4_17
See this article

Büchi context-free languages

Zoltán Ésik and Szabolcs Iván
Theoretical Computer Science 412 (8-10) 805 (2011)
DOI: 10.1016/j.tcs.2010.11.026
See this article

Continuous monoids and yields of infinite trees

M. Dauchet and E. Timmerman
RAIRO - Theoretical Informatics and Applications 20 (3) 251 (1986)
DOI: 10.1051/ita/1986200302511
See this article

Clique-width of countable graphs: a compactness property

B. Courcelle
Discrete Mathematics 276 (1-3) 127 (2004)
DOI: 10.1016/S0012-365X(03)00303-0
See this article

A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS

ALEXIS BÈS and OLIVIER CARTON
International Journal of Foundations of Computer Science 17 (03) 519 (2006)
DOI: 10.1142/S0129054106003978
See this article

S. L. Bloom and Z. Ésik
4624 1 (2007)
DOI: 10.1007/978-3-540-73859-6_1
See this article

Infinite hypergraphs I. Basic properties

Michael Bauderon
Theoretical Computer Science 82 (2) 177 (1991)
DOI: 10.1016/0304-3975(91)90222-N
See this article

Markus Lohrey and Christian Mathissen
6756 210 (2011)
DOI: 10.1007/978-3-642-22012-8_16
See this article