RAIRO. Inform. théor., 11 4 (1977) 311-327

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:

Mots infinis engendrés par une grammaire algébrique

Maurice Nivat

RAIRO. Inform. théor., 11 4 (1977) 311-327

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1977110403111

This article has been cited by the following article(s):

Infinite-word languages and continuous mappings

Roman R. Redziejowski
Theoretical Computer Science 43 59 (1986)
DOI: 10.1016/0304-3975(86)90166-0
See this article

Fixed-point characterization of context-free ∞-languages

Damian Niwiński
Information and Control 61 (3) 247 (1984)
DOI: 10.1016/S0019-9958(84)80049-2
See this article

Langages sur des alphabets infinis

Jean-Michel Autebert, Joffroy Beauquier and Luc Boasson
Discrete Applied Mathematics 2 (1) 1 (1980)
DOI: 10.1016/0166-218X(80)90050-5
See this article

Langages algébriques de mots biinfinis

F. Gire and M. Nivat
Theoretical Computer Science 86 (2) 277 (1991)
DOI: 10.1016/0304-3975(91)90022-T
See this article

Borel hierarchy and omega context free languages

Olivier Finkel
Theoretical Computer Science 290 (3) 1385 (2003)
DOI: 10.1016/S0304-3975(02)00042-7
See this article

On finite computations in denotational semantics

J.W. de Bakker, J.-J.Ch. Meyer and J.I. Zucker
Theoretical Computer Science 26 (1-2) 53 (1983)
DOI: 10.1016/0304-3975(83)90079-8
See this article

D. Caucal
210 37 (1986)
DOI: 10.1007/3-540-16078-7_63
See this article

J. W. de Bakker, J. A. Bergstra, J. W. Klop and J. -J. Ch. Meyer
154 39 (1983)
DOI: 10.1007/BFb0036896
See this article

Patrick Cousot and Radhia Cousot
1349 138 (1997)
DOI: 10.1007/BFb0000468
See this article

Formal computations of non deterministic recursive program schemes

André Arnold and Maurice Nivat
Mathematical Systems Theory 13 (1) 219 (1979)
DOI: 10.1007/BF01744297
See this article

Seymour Ginsburg
1 (1980)
DOI: 10.1016/B978-0-12-115350-2.50006-3
See this article

Bruno Courcelle
417 (1982)
DOI: 10.1007/978-94-009-7893-5_13
See this article

Frontiers of infinite trees

Bruno Courcelle
RAIRO. Informatique théorique 12 (4) 319 (1978)
DOI: 10.1051/ita/1978120403191
See this article

Sémantique des processus communicants

André Arnold
RAIRO. Informatique théorique 15 (2) 103 (1981)
DOI: 10.1051/ita/1981150201031
See this article

Sur les ensembles de mots infinis engendrés par une grammaire algébrique

Maurice Nivat
RAIRO. Informatique théorique 12 (3) 259 (1978)
DOI: 10.1051/ita/1978120302591
See this article

Ludwig Staiger
339 (1997)
DOI: 10.1007/978-3-642-59126-6_6
See this article

Maurice Nivat
473 (1982)
DOI: 10.1007/978-94-009-7893-5_14
See this article

Mots infinis et langages commutatifs

Michel Latteux
RAIRO. Informatique théorique 12 (3) 185 (1978)
DOI: 10.1051/ita/1978120301851
See this article

L. Boasson
67 1 (1979)
DOI: 10.1007/3-540-09118-1_1
See this article

Highly Undecidable Problems For Infinite Computations

Olivier Finkel
RAIRO - Theoretical Informatics and Applications 43 (2) 339 (2009)
DOI: 10.1051/ita/2009001
See this article

Arbres infinis et systèmes d'équations

Bruno Courcelle
RAIRO. Informatique théorique 13 (1) 31 (1979)
DOI: 10.1051/ita/1979130100311
See this article

J. W. Bakker and E. P. Vink
494 1 (1991)
DOI: 10.1007/3540539816_55
See this article

Olivier Finkel
8001 50 (2014)
DOI: 10.1007/978-3-642-45321-2_4
See this article

Ambiguity in omega context free languages

Olivier Finkel
Theoretical Computer Science 301 (1-3) 217 (2003)
DOI: 10.1016/S0304-3975(02)00584-4
See this article

Wadge hierarchy of omega context-free languages

Olivier Finkel
Theoretical Computer Science 269 (1-2) 283 (2001)
DOI: 10.1016/S0304-3975(01)00008-1
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

On a subclass of ∞-regular languages

Ivan Mezník
Theoretical Computer Science 61 (1) 25 (1988)
DOI: 10.1016/0304-3975(88)90105-3
See this article

Topological properties of omega context-free languages

Olivier Finkel
Theoretical Computer Science 262 (1-2) 669 (2001)
DOI: 10.1016/S0304-3975(00)00405-9
See this article

Languages infinitaires et produit de mixage

Robert De Simone
Theoretical Computer Science 31 (1-2) 83 (1984)
DOI: 10.1016/0304-3975(84)90128-2
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

Adherences of languages

Luc Boasson and Maurice Nivat
Journal of Computer and System Sciences 20 (3) 285 (1980)
DOI: 10.1016/0022-0000(80)90010-0
See this article

Axel Poigné
117 301 (1981)
DOI: 10.1007/3-540-10854-8_33
See this article

Some remarks on non-algebraic adherences

Sorin Istrail
Theoretical Computer Science 21 (3) 341 (1982)
DOI: 10.1016/0304-3975(82)90080-9
See this article

On omega context free languages which are Borel sets of infinite rank

Olivier Finkel
Theoretical Computer Science 299 (1-3) 327 (2003)
DOI: 10.1016/S0304-3975(02)00327-4
See this article

N. Polian
112 340 (1981)
DOI: 10.1007/3-540-10828-9_74
See this article

Linear time and branching time semantics for recursion with merge

J.W. De Bakker, J.A. Bergstra, J.W. Klop and J.-J.Ch. Meyer
Theoretical Computer Science 34 (1-2) 135 (1984)
DOI: 10.1016/0304-3975(84)90114-2
See this article