On simple representations of language families
RAIRO. Inform. théor., 13 3 (1979) 241-250
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):
On hardest languages for one-dimensional cellular automata
Mikhail Mrykhin and Alexander OkhotinInformation and Computation 295 104891 (2023)
https://doi.org/10.1016/j.ic.2022.104891
The hardest language for grammars with context operators
Mikhail Mrykhin and Alexander OkhotinTheoretical Computer Science 958 113829 (2023)
https://doi.org/10.1016/j.tcs.2023.113829
The Hardest LL(k) Language
Mikhail Mrykhin and Alexander OkhotinInternational Journal of Foundations of Computer Science 34 (02n03) 289 (2023)
https://doi.org/10.1142/S012905412344001X
Developments in Language Theory
Mikhail Mrykhin and Alexander OkhotinLecture Notes in Computer Science, Developments in Language Theory 12811 304 (2021)
https://doi.org/10.1007/978-3-030-81508-0_25
Hardest languages for conjunctive and Boolean grammars
Alexander OkhotinInformation and Computation 266 1 (2019)
https://doi.org/10.1016/j.ic.2018.11.001
Computer Science – Theory and Applications
Alexander OkhotinLecture Notes in Computer Science, Computer Science – Theory and Applications 9691 340 (2016)
https://doi.org/10.1007/978-3-319-34171-2_24
Publications of K. Culik
RAIRO - Theoretical Informatics and Applications 28 (3-4) 425 (1994)https://doi.org/10.1051/ita/1994283-404251
Bifaithful starry transductions
M. Latteux and E. TimmermanInformation Processing Letters 28 (1) 1 (1988)
https://doi.org/10.1016/0020-0190(88)90135-4
Automata, Languages and Programming
Juhani KarhumäkiLecture Notes in Computer Science, Automata, Languages and Programming 267 136 (1987)
https://doi.org/10.1007/3-540-18088-5_12
Representations of language families by homomorphic equality operations and generalized equality sets
Franz-Josef BrandenburgTheoretical Computer Science 55 (2-3) 183 (1987)
https://doi.org/10.1016/0304-3975(87)90103-4
The Book of L
K. Culik and J. KarhumäkiThe Book of L 63 (1986)
https://doi.org/10.1007/978-3-642-95486-3_5
On characterisation of language families in terms of inverse morphisms
Paavo TurakainenInternational Journal of Computer Mathematics 16 (4) 189 (1984)
https://doi.org/10.1080/00207168408803437
Remarks on multihead pushdown automata and multihead stack automata
Satoru MiyanoJournal of Computer and System Sciences 27 (1) 116 (1983)
https://doi.org/10.1016/0022-0000(83)90032-6
Automata, Languages and Programming
M. Latteux and J. LeguyLecture Notes in Computer Science, Automata, Languages and Programming 154 420 (1983)
https://doi.org/10.1007/BFb0036926
Automata, Languages and Programming
Franz-Josef BrandenburgLecture Notes in Computer Science, Automata, Languages and Programming 140 83 (1982)
https://doi.org/10.1007/BFb0012759
Automata, Languages and Programming
Sorin IstrailLecture Notes in Computer Science, Automata, Languages and Programming 115 333 (1981)
https://doi.org/10.1007/3-540-10843-2_28
On the equality sets for homomorphisms on free monoids with two generators
K. Culik II and J. KarhumäkiRAIRO. Informatique théorique 14 (4) 349 (1980)
https://doi.org/10.1051/ita/1980140403491
Equality Sets and Complexity Classes
Ronald V. Book and Franz–Josef BrandenburgSIAM Journal on Computing 9 (4) 729 (1980)
https://doi.org/10.1137/0209057