Sur les ensembles de mots infinis engendrés par une grammaire algébrique
RAIRO. Inform. théor., 12 3 (1978) 259-278
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
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
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
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
Representing real numbers in a generalized numeration system
Émilie Charlier, Marion Le Gonidec and Michel RigoJournal of Computer and System Sciences 77 (4) 743 (2011)
https://doi.org/10.1016/j.jcss.2010.07.002
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
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
Highly Undecidable Problems For Infinite Computations
Olivier FinkelRAIRO - Theoretical Informatics and Applications 43 (2) 339 (2009)
https://doi.org/10.1051/ita/2009001
Infinity in Logic and Computation
Douadi MihoubiLecture Notes in Computer Science, Infinity in Logic and Computation 5489 97 (2009)
https://doi.org/10.1007/978-3-642-03092-5_8
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
Bi-inductive structural semantics
Patrick Cousot and Radhia CousotInformation and Computation 207 (2) 258 (2009)
https://doi.org/10.1016/j.ic.2008.03.025
New Computational Paradigms
Olivier FinkelLecture Notes in Computer Science, New Computational Paradigms 3526 129 (2005)
https://doi.org/10.1007/11494645_17
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
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
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
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
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
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
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
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
Formal languages and global cellular automaton behavior
K. Culik, L.P. Hurd and S. YuPhysica D: Nonlinear Phenomena 45 (1-3) 396 (1990)
https://doi.org/10.1016/0167-2789(90)90197-W
Computation theoretic aspects of cellular automata
K. Culik, L.P. Hurd and S. YuPhysica D: Nonlinear Phenomena 45 (1-3) 357 (1990)
https://doi.org/10.1016/0167-2789(90)90194-T
On generators of rational ω-power languages
I. Litovsky and E. TimmermanTheoretical Computer Science 53 (2-3) 187 (1987)
https://doi.org/10.1016/0304-3975(87)90063-6
Mathematical Foundations of Computer Science 1986
Ludwig Staiger and Werner NehrlichLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1986 233 594 (1986)
https://doi.org/10.1007/BFb0016286
Current Trends in Concurrency
H. J. Hoogeboom and G. RozenbergLecture Notes in Computer Science, Current Trends in Concurrency 224 266 (1986)
https://doi.org/10.1007/BFb0027043
Infinite-word languages and continuous mappings
Roman R. RedziejowskiTheoretical Computer Science 43 59 (1986)
https://doi.org/10.1016/0304-3975(86)90166-0
Finitely generated ω-languages
M. Latteux and E. TimmermanInformation Processing Letters 23 (4) 171 (1986)
https://doi.org/10.1016/0020-0190(86)90131-6
STACS 86
D. CaucalLecture Notes in Computer Science, STACS 86 210 37 (1986)
https://doi.org/10.1007/3-540-16078-7_63
Two characterizations of rational adherences
M. Latteux and E. TimmermanTheoretical Computer Science 46 101 (1986)
https://doi.org/10.1016/0304-3975(86)90025-3
Combinatorial Algorithms on Words
Antonio Restivo and Sergio SalemiCombinatorial Algorithms on Words 289 (1985)
https://doi.org/10.1007/978-3-642-82456-2_20
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
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
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
STACS 84
Jeanne IdtLecture Notes in Computer Science, STACS 84 166 260 (1984)
https://doi.org/10.1007/3-540-12920-0_24
CAAP'83
Sorin Istrail and Cristian MasalagiuLecture Notes in Computer Science, CAAP'83 159 255 (1983)
https://doi.org/10.1007/3-540-12727-5_15
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
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
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
Topologies sur des espaces ordonnés
J. BetremaRAIRO. Informatique théorique 16 (2) 165 (1982)
https://doi.org/10.1051/ita/1982160201651
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
Mots sans carre et morphismes iteres
Jean BerstelDiscrete Mathematics 29 (3) 235 (1980)
https://doi.org/10.1016/0012-365X(80)90151-X
Formal Language Theory
Joffroy Beauquier and Maurice NivatFormal Language Theory 407 (1980)
https://doi.org/10.1016/B978-0-12-115350-2.50018-X
Sur les g�n�rateurs alg�briques et lin�aires
Michel LatteuxActa Informatica 13 (4) 347 (1980)
https://doi.org/10.1007/BF00288769
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
Un langage algébrique particulier
L. BoassonRAIRO. Informatique théorique 13 (3) 203 (1979)
https://doi.org/10.1051/ita/1979130302031