Mots infinis engendrés par une grammaire algébrique
RAIRO. Inform. théor., 11 4 (1977) 311-327
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):
14740 237 (2024)
https://doi.org/10.1007/978-3-031-63501-4_13
Language, Culture, Computation. Computing - Theory and Technology
Olivier FinkelLecture Notes in Computer Science, Language, Culture, Computation. Computing - Theory and Technology 8001 50 (2014)
https://doi.org/10.1007/978-3-642-45321-2_4
Highly Undecidable Problems For Infinite Computations
Olivier FinkelRAIRO - Theoretical Informatics and Applications 43 (2) 339 (2009)
https://doi.org/10.1051/ita/2009001
Ambiguity in omega context free languages
Olivier FinkelTheoretical Computer Science 301 (1-3) 217 (2003)
https://doi.org/10.1016/S0304-3975(02)00584-4
On omega context free languages which are Borel sets of infinite rank
Olivier FinkelTheoretical Computer Science 299 (1-3) 327 (2003)
https://doi.org/10.1016/S0304-3975(02)00327-4
Borel hierarchy and omega context free languages
Olivier FinkelTheoretical Computer Science 290 (3) 1385 (2003)
https://doi.org/10.1016/S0304-3975(02)00042-7
Topological properties of omega context-free languages
Olivier FinkelTheoretical Computer Science 262 (1-2) 669 (2001)
https://doi.org/10.1016/S0304-3975(00)00405-9
Wadge hierarchy of omega context-free languages
Olivier FinkelTheoretical Computer Science 269 (1-2) 283 (2001)
https://doi.org/10.1016/S0304-3975(01)00008-1
Handbook of Formal Languages
Ludwig StaigerHandbook of Formal Languages 339 (1997)
https://doi.org/10.1007/978-3-642-59126-6_6
Algebraic Methodology and Software Technology
Patrick Cousot and Radhia CousotLecture Notes in Computer Science, Algebraic Methodology and Software Technology 1349 138 (1997)
https://doi.org/10.1007/BFb0000468
TAPSOFT '91
J. W. Bakker and E. P. VinkLecture Notes in Computer Science, TAPSOFT '91 494 1 (1991)
https://doi.org/10.1007/3540539816_55
Langages algébriques de mots biinfinis
F. Gire and M. NivatTheoretical Computer Science 86 (2) 277 (1991)
https://doi.org/10.1016/0304-3975(91)90022-T
On a subclass of ∞-regular languages
Ivan MezníkTheoretical Computer Science 61 (1) 25 (1988)
https://doi.org/10.1016/0304-3975(88)90105-3
Infinite-word languages and continuous mappings
Roman R. RedziejowskiTheoretical Computer Science 43 59 (1986)
https://doi.org/10.1016/0304-3975(86)90166-0
STACS 86
D. CaucalLecture Notes in Computer Science, STACS 86 210 37 (1986)
https://doi.org/10.1007/3-540-16078-7_63
Fixed-point characterization of context-free ∞-languages
Damian NiwińskiInformation and Control 61 (3) 247 (1984)
https://doi.org/10.1016/S0019-9958(84)80049-2
Languages infinitaires et produit de mixage
Robert De SimoneTheoretical Computer Science 31 (1-2) 83 (1984)
https://doi.org/10.1016/0304-3975(84)90128-2
Linear time and branching time semantics for recursion with merge
J.W. De Bakker, J.A. Bergstra, J.W. Klop and J.-J.Ch. MeyerTheoretical Computer Science 34 (1-2) 135 (1984)
https://doi.org/10.1016/0304-3975(84)90114-2
Fundamental properties of infinite trees
Bruno CourcelleTheoretical Computer Science 25 (2) 95 (1983)
https://doi.org/10.1016/0304-3975(83)90059-2
Automata, Languages and Programming
J. W. de Bakker, J. A. Bergstra, J. W. Klop and J. -J. Ch. MeyerLecture Notes in Computer Science, Automata, Languages and Programming 154 39 (1983)
https://doi.org/10.1007/BFb0036896
On finite computations in denotational semantics
J.W. de Bakker, J.-J.Ch. Meyer and J.I. ZuckerTheoretical Computer Science 26 (1-2) 53 (1983)
https://doi.org/10.1016/0304-3975(83)90079-8
Theoretical Foundations of Programming Methodology
Maurice NivatTheoretical Foundations of Programming Methodology 473 (1982)
https://doi.org/10.1007/978-94-009-7893-5_14
Some remarks on non-algebraic adherences
Sorin IstrailTheoretical Computer Science 21 (3) 341 (1982)
https://doi.org/10.1016/0304-3975(82)90080-9
Theoretical Foundations of Programming Methodology
Bruno CourcelleTheoretical Foundations of Programming Methodology 417 (1982)
https://doi.org/10.1007/978-94-009-7893-5_13
Sémantique des processus communicants
André ArnoldRAIRO. Informatique théorique 15 (2) 103 (1981)
https://doi.org/10.1051/ita/1981150201031
CAAP '81
N. PolianLecture Notes in Computer Science, CAAP '81 112 340 (1981)
https://doi.org/10.1007/3-540-10828-9_74
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
Adherences of languages
Luc Boasson and Maurice NivatJournal of Computer and System Sciences 20 (3) 285 (1980)
https://doi.org/10.1016/0022-0000(80)90010-0
Langages sur des alphabets infinis
Jean-Michel Autebert, Joffroy Beauquier and Luc BoassonDiscrete Applied Mathematics 2 (1) 1 (1980)
https://doi.org/10.1016/0166-218X(80)90050-5
Formal Language Theory
Seymour GinsburgFormal Language Theory 1 (1980)
https://doi.org/10.1016/B978-0-12-115350-2.50006-3
Theoretical Computer Science 4th GI Conference
L. BoassonLecture Notes in Computer Science, Theoretical Computer Science 4th GI Conference 67 1 (1979)
https://doi.org/10.1007/3-540-09118-1_1
Formal computations of non deterministic recursive program schemes
André Arnold and Maurice NivatMathematical Systems Theory 13 (1) 219 (1979)
https://doi.org/10.1007/BF01744297
Arbres infinis et systèmes d'équations
Bruno CourcelleRAIRO. Informatique théorique 13 (1) 31 (1979)
https://doi.org/10.1051/ita/1979130100311
Frontiers of infinite trees
Bruno CourcelleRAIRO. Informatique théorique 12 (4) 319 (1978)
https://doi.org/10.1051/ita/1978120403191
Sur les ensembles de mots infinis engendrés par une grammaire algébrique
Maurice NivatRAIRO. Informatique théorique 12 (3) 259 (1978)
https://doi.org/10.1051/ita/1978120302591
Mots infinis et langages commutatifs
Michel LatteuxRAIRO. Informatique théorique 12 (3) 185 (1978)
https://doi.org/10.1051/ita/1978120301851