Hierarchies of aperiodic languages
R.A.I.R.O. Informatique théorique, 10 R2 (1976) 33-49
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):
State complexity bounds for projection, shuffle, union, intersection, up- and downward closure and interior on commutative regular languages
Stefan HoffmannInformation and Computation 105204 (2024)
https://doi.org/10.1016/j.ic.2024.105204
Pro-aperiodic monoids via saturated models
Samuel J. van Gool and Benjamin SteinbergIsrael Journal of Mathematics 234 (1) 451 (2019)
https://doi.org/10.1007/s11856-019-1947-6
On the expressiveness of spider diagrams and commutative star-free regular languages
Aidan Delaney, Gem Stapleton, John Taylor and Simon ThompsonJournal of Visual Languages & Computing 24 (4) 273 (2013)
https://doi.org/10.1016/j.jvlc.2013.02.001
Efficiency of automata in semi-commutation verification techniques
Gérard Cécé, Pierre-Cyrille Héam and Yann MainierRAIRO - Theoretical Informatics and Applications 42 (2) 197 (2008)
https://doi.org/10.1051/ita:2007029
Inference of Reversible Tree Languages
D. Lopez, J.M. Sempere and P. GarciaIEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 34 (4) 1658 (2004)
https://doi.org/10.1109/TSMCB.2004.827190
Grammars and Automata for String Processing
Valentino Braitenberg and Stefano Crespi ReghizziTopics in Computer Mathematics, Grammars and Automata for String Processing 20032543 17 (2003)
https://doi.org/10.1201/9780203009642.ch3
On the convexity of games corresponding to sequencing situations with due dates
Peter Borm, Gloria Fiestras-Janeiro, Herbert Hamers, Estela Sánchez and Mark VoorneveldEuropean Journal of Operational Research 136 (3) 616 (2002)
https://doi.org/10.1016/S0377-2217(01)00070-4
Formal Properties of Finite Automata and Applications
Pascal WeilLecture Notes in Computer Science, Formal Properties of Finite Automata and Applications 386 120 (1989)
https://doi.org/10.1007/BFb0013116
Graph congruences and pair testing
J. A. Brzozowski and Robert KnastRAIRO - Theoretical Informatics and Applications 20 (2) 129 (1986)
https://doi.org/10.1051/ita/1986200201291
Varieties of finite categories
Alex Weiss and Denis TherienRAIRO - Theoretical Informatics and Applications 20 (3) 357 (1986)
https://doi.org/10.1051/ita/1986200303571
Characterizations of some classes of regular events
Jacques SternTheoretical Computer Science 35 17 (1985)
https://doi.org/10.1016/0304-3975(85)90003-9
Hiérarchies de concaténation
Jean-Eric PinRAIRO. Informatique théorique 18 (1) 23 (1984)
https://doi.org/10.1051/ita/1984180100231
A semigroup characterization of dot-depth one languages
Robert KnastRAIRO. Informatique théorique 17 (4) 321 (1983)
https://doi.org/10.1051/ita/1983170403211
Combinatorics on Words
Jean-Eric PinCombinatorics on Words 195 (1983)
https://doi.org/10.1016/B978-0-12-198820-3.50016-4
Automata, Languages and Programming
Jean -Eric PinLecture Notes in Computer Science, Automata, Languages and Programming 154 617 (1983)
https://doi.org/10.1007/BFb0036942
Automata, Languages and Programming
Jean-Eric PinLecture Notes in Computer Science, Automata, Languages and Programming 115 184 (1981)
https://doi.org/10.1007/3-540-10843-2_15
Séries formelles et algèbres syntactiques
Christophe ReutenauerJournal of Algebra 66 (2) 448 (1980)
https://doi.org/10.1016/0021-8693(80)90097-6
Theoretical Computer Science 4th GI Conference
Christophe ReutenauerLecture Notes in Computer Science, Theoretical Computer Science 4th GI Conference 67 260 (1979)
https://doi.org/10.1007/3-540-09118-1_27
Fundamentals of Computation Theory
J -F. PerrotLecture Notes in Computer Science, Fundamentals of Computation Theory 56 152 (1977)
https://doi.org/10.1007/3-540-08442-8_81
Mathematical Foundations of Computer Science 1976
Robert KnastLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1976 45 395 (1976)
https://doi.org/10.1007/3-540-07854-1_205