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):

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)
DOI: 10.1007/978-3-642-38536-0_22
See this article

Further closure properties of input-driven pushdown automata

Alexander Okhotin and Kai Salomaa
Theoretical Computer Science 798 65 (2019)
DOI: 10.1016/j.tcs.2019.04.006
See this article

Language operations with regular expressions of polynomial size

Hermann Gruber and Markus Holzer
Theoretical Computer Science 410 (35) 3281 (2009)
DOI: 10.1016/j.tcs.2009.04.009
See this article

Descriptional Complexity of Formal Systems

Daniel Gabric, Štěpán Holub and Jeffrey Shallit
Lecture Notes in Computer Science, Descriptional Complexity of Formal Systems 11612 137 (2019)
DOI: 10.1007/978-3-030-23247-4_10
See this article

Complexity in Prefix-Free Regular Languages

Galina Jirásková and Monika Krausová
Electronic Proceedings in Theoretical Computer Science 31 197 (2010)
DOI: 10.4204/EPTCS.31.22
See this article

State complexity of combined operations

Arto Salomaa, Kai Salomaa and Sheng Yu
Theoretical Computer Science 383 (2-3) 140 (2007)
DOI: 10.1016/j.tcs.2007.04.015
See this article

COMPLEXITY IN UNION-FREE REGULAR LANGUAGES

GALINA JIRÁSKOVÁ and TOMÁŠ MASOPUST
International Journal of Foundations of Computer Science 22 (07) 1639 (2011)
DOI: 10.1142/S0129054111008933
See this article

State complexity of combined operations with two basic operations

Bo Cui, Yuan Gao, Lila Kari and Sheng Yu
Theoretical Computer Science 437 82 (2012)
DOI: 10.1016/j.tcs.2012.02.030
See this article

Operations on Automata with All States Final

Kristína Čevorová, Galina Jirásková, Peter Mlynárčik, Matúš Palmovský and Juraj Šebej
Electronic Proceedings in Theoretical Computer Science 151 201 (2014)
DOI: 10.4204/EPTCS.151.14
See this article

State complexity of union and intersection of square and reversal on k regular languages

Yuan Gao, Lila Kari and Sheng Yu
Theoretical Computer Science 454 164 (2012)
DOI: 10.1016/j.tcs.2012.03.046
See this article

NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY

MARKUS HOLZER and MARTIN KUTRIB
International Journal of Foundations of Computer Science 20 (04) 563 (2009)
DOI: 10.1142/S0129054109006747
See this article

Developments in Language Theory

Sylvie Davies
Lecture Notes in Computer Science, Developments in Language Theory 11088 256 (2018)
DOI: 10.1007/978-3-319-98654-8_21
See this article

Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem

Pascal Caron, Edwin Hamel-de le Court and Jean-Gabriel Luque
Electronic Proceedings in Theoretical Computer Science 305 154 (2019)
DOI: 10.4204/EPTCS.305.11
See this article

Nondeterministic complexity in subclasses of convex languages

Michal Hospodár, Galina Jirásková and Peter Mlynárčik
Theoretical Computer Science (2019)
DOI: 10.1016/j.tcs.2018.12.027
See this article

Quotient Complexity of Regular Languages

Janusz Brzozowski
Electronic Proceedings in Theoretical Computer Science 3 17 (2009)
DOI: 10.4204/EPTCS.3.2
See this article

Nondeterministic State Complexity of Positional Addition

Galina Jirásková and Alexander Okhotin
Electronic Proceedings in Theoretical Computer Science 3 151 (2009)
DOI: 10.4204/EPTCS.3.14
See this article

Implementation and Applications of Automata

Markus Holzer and Martin Kutrib
Lecture Notes in Computer Science, Implementation and Applications of Automata 5148 1 (2008)
DOI: 10.1007/978-3-540-70844-5_1
See this article

Developments in Language Theory

Galina Jirásková and Tomáš Masopust
Lecture Notes in Computer Science, Developments in Language Theory 6224 255 (2010)
DOI: 10.1007/978-3-642-14455-4_24
See this article

Descriptional Complexity of Formal Systems

Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi and Giovanni Pighizzini
Lecture Notes in Computer Science, Descriptional Complexity of Formal Systems 7386 89 (2012)
DOI: 10.1007/978-3-642-31623-4_7
See this article

Theoretical Computer Science

Galina Jirásková and Tomáš Masopust
Lecture Notes in Computer Science, Theoretical Computer Science 7604 164 (2012)
DOI: 10.1007/978-3-642-33475-7_12
See this article

Language and Automata Theory and Applications

Alexander Okhotin and Alexey Sorokin
Lecture Notes in Computer Science, Language and Automata Theory and Applications 12038 287 (2020)
DOI: 10.1007/978-3-030-40608-0_20
See this article

Developments in Language Theory

Michal Hospodár and Peter Mlynárčik
Lecture Notes in Computer Science, Developments in Language Theory 12086 122 (2020)
DOI: 10.1007/978-3-030-48516-0_10
See this article