EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues RAIRO. Inform. théor., 12 4 (1978) 319-337 Article references

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

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

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

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

Infinite Words - Automata, Semigroups, Logic and Games

Pure and Applied Mathematics, Infinite Words - Automata, Semigroups, Logic and Games 141 499 (2004)
DOI: 10.1016/S0079-8169(04)80014-X
See this article

Descriptional Complexity of Formal Systems

Zoltán Ésik and Szabolcs Iván
Lecture Notes in Computer Science, Descriptional Complexity of Formal Systems 9777 87 (2016)
DOI: 10.1007/978-3-319-41114-9_7
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

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

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

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

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