State complexity of cyclic shift
RAIRO-Theor. Inf. Appl., 42 2 (2008) 335-360
Published online: 2007-12-13
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 Concatenations of Regular Circular Word Languages
Bilal Abdallah and Benedek NagyMathematics 13 (5) 763 (2025)
https://doi.org/10.3390/math13050763
Nondeterministic operational complexity in subregular languages
Michal Hospodár and Viktor OlejárTheoretical Computer Science 972 114075 (2023)
https://doi.org/10.1016/j.tcs.2023.114075
Counting (Watson-Crick) palindromes in Watson-Crick conjugates
Kalpana Mahalingam, Anuran Maity and Palak PandohInformation and Computation 285 104863 (2022)
https://doi.org/10.1016/j.ic.2021.104863
Operational complexity and pumping lemmas
Jürgen Dassow and Ismaël JeckerActa Informatica 59 (4) 337 (2022)
https://doi.org/10.1007/s00236-022-00431-3
Maximal state complexity and generalized de Bruijn words
Daniel Gabric, Štěpán Holub and Jeffrey ShallitInformation and Computation 284 104689 (2022)
https://doi.org/10.1016/j.ic.2021.104689
Combination of roots and boolean operations: An application to state complexity
Pascal Caron, Edwin Hamel-de le Court and Jean-Gabriel LuqueInformation and Computation 289 104961 (2022)
https://doi.org/10.1016/j.ic.2022.104961
Further Remarks on the Operational Nonterminal Complexity
Jürgen DassowInternational Journal of Foundations of Computer Science 32 (05) 439 (2021)
https://doi.org/10.1142/S0129054121410021
Block reversal on finite words
Kalpana Mahalingam, Anuran Maity, Palak Pandoh and Rama RaghavanTheoretical Computer Science 894 135 (2021)
https://doi.org/10.1016/j.tcs.2021.06.046
Developments in Language Theory
Michal Hospodár and Peter MlynárčikLecture Notes in Computer Science, Developments in Language Theory 12086 122 (2020)
https://doi.org/10.1007/978-3-030-48516-0_10
12442 142 (2020)
https://doi.org/10.1007/978-3-030-62536-8_12
12038 287 (2020)
https://doi.org/10.1007/978-3-030-40608-0_20
Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem
Pascal Caron, Edwin Hamel-de le Court and Jean-Gabriel LuqueElectronic Proceedings in Theoretical Computer Science 305 154 (2019)
https://doi.org/10.4204/EPTCS.305.11
Further closure properties of input-driven pushdown automata
Alexander Okhotin and Kai SalomaaTheoretical Computer Science 798 65 (2019)
https://doi.org/10.1016/j.tcs.2019.04.006
11612 137 (2019)
https://doi.org/10.1007/978-3-030-23247-4_10
Nondeterministic complexity in subclasses of convex languages
Michal Hospodár, Galina Jirásková and Peter MlynárčikTheoretical Computer Science (2019)
https://doi.org/10.1016/j.tcs.2018.12.027
Developments in Language Theory
Sylvie DaviesLecture Notes in Computer Science, Developments in Language Theory 11088 256 (2018)
https://doi.org/10.1007/978-3-319-98654-8_21
Operations on Automata with All States Final
Kristína Čevorová, Galina Jirásková, Peter Mlynárčik, Matúš Palmovský and Juraj ŠebejElectronic Proceedings in Theoretical Computer Science 151 201 (2014)
https://doi.org/10.4204/EPTCS.151.14
Computer Science – Theory and Applications
Jozef Jirásek and Galina JiráskováLecture Notes in Computer Science, Computer Science – Theory and Applications 7913 246 (2013)
https://doi.org/10.1007/978-3-642-38536-0_22
Theoretical Computer Science
Galina Jirásková and Tomáš MasopustLecture Notes in Computer Science, Theoretical Computer Science 7604 164 (2012)
https://doi.org/10.1007/978-3-642-33475-7_12
Descriptional Complexity of Formal Systems
Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi and Giovanni PighizziniLecture Notes in Computer Science, Descriptional Complexity of Formal Systems 7386 89 (2012)
https://doi.org/10.1007/978-3-642-31623-4_7
State complexity of union and intersection of square and reversal on k
Yuan Gao, Lila Kari and Sheng YuTheoretical Computer Science 454 164 (2012)
https://doi.org/10.1016/j.tcs.2012.03.046
State complexity of combined operations with two basic operations
Bo Cui, Yuan Gao, Lila Kari and Sheng YuTheoretical Computer Science 437 82 (2012)
https://doi.org/10.1016/j.tcs.2012.02.030
COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
GALINA JIRÁSKOVÁ and TOMÁŠ MASOPUSTInternational Journal of Foundations of Computer Science 22 (07) 1639 (2011)
https://doi.org/10.1142/S0129054111008933
Developments in Language Theory
Galina Jirásková and Tomáš MasopustLecture Notes in Computer Science, Developments in Language Theory 6224 255 (2010)
https://doi.org/10.1007/978-3-642-14455-4_24
Complexity in Prefix-Free Regular Languages
Galina Jirásková and Monika KrausováElectronic Proceedings in Theoretical Computer Science 31 197 (2010)
https://doi.org/10.4204/EPTCS.31.22
Language operations with regular expressions of polynomial size
Hermann Gruber and Markus HolzerTheoretical Computer Science 410 (35) 3281 (2009)
https://doi.org/10.1016/j.tcs.2009.04.009
Nondeterministic State Complexity of Positional Addition
Galina Jirásková and Alexander OkhotinElectronic Proceedings in Theoretical Computer Science 3 151 (2009)
https://doi.org/10.4204/EPTCS.3.14
Quotient Complexity of Regular Languages
Janusz BrzozowskiElectronic Proceedings in Theoretical Computer Science 3 17 (2009)
https://doi.org/10.4204/EPTCS.3.2
NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
MARKUS HOLZER and MARTIN KUTRIBInternational Journal of Foundations of Computer Science 20 (04) 563 (2009)
https://doi.org/10.1142/S0129054109006747
Implementation and Applications of Automata
Markus Holzer and Martin KutribLecture Notes in Computer Science, Implementation and Applications of Automata 5148 1 (2008)
https://doi.org/10.1007/978-3-540-70844-5_1
State complexity of combined operations
Arto Salomaa, Kai Salomaa and Sheng YuTheoretical Computer Science 383 (2-3) 140 (2007)
https://doi.org/10.1016/j.tcs.2007.04.015