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:

On biautomata

Ondřej Klíma, Libor Polák

RAIRO-Theor. Inf. Appl., 46 4 (2012) 573-592

Published online: 2012-06-19

DOI: https://doi.org/10.1051/ita/2012014

This article has been cited by the following article(s):

Descriptional Complexity of Formal Systems

Markus Holzer and Sebastian Jakobi
Lecture Notes in Computer Science, Descriptional Complexity of Formal Systems 8031 112 (2013)
DOI: 10.1007/978-3-642-39310-5_12
See this article

On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)

Ondřej Klíma
Electronic Proceedings in Theoretical Computer Science 151 49 (2014)
DOI: 10.4204/EPTCS.151.3
See this article

More Structural Characterizations of Some Subregular Language Families by Biautomata

Markus Holzer and Sebastian Jakobi
Electronic Proceedings in Theoretical Computer Science 151 271 (2014)
DOI: 10.4204/EPTCS.151.19
See this article

Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines

Vladimir A. Zakharov
Modeling and Analysis of Information Systems 27 (3) 260 (2020)
DOI: 10.18255/1818-1015-2020-3-260-303
See this article

On shuffle products, acyclic automata and piecewise-testable languages

S. Halfon and Ph. Schnoebelen
Information Processing Letters 145 68 (2019)
DOI: 10.1016/j.ipl.2019.01.012
See this article

Language and Automata Theory and Applications

Galina Jirásková and Ondřej Klíma
Lecture Notes in Computer Science, Language and Automata Theory and Applications 11417 315 (2019)
DOI: 10.1007/978-3-030-13435-8_23
See this article

Libor Polák (1950–2020)

Jiří Kad’ourek and Ondřej Klíma
Semigroup Forum 102 (2) 315 (2021)
DOI: 10.1007/s00233-021-10177-y
See this article

Characterization and complexity results on jumping finite automata

Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid and Vojtěch Vorel
Theoretical Computer Science 679 31 (2017)
DOI: 10.1016/j.tcs.2016.07.006
See this article

Henning Fernau, Meenakshi Paramasivan and Markus L. Schmid
9223 89 (2015)
DOI: 10.1007/978-3-319-22360-5_8
See this article

On linear languages recognized by deterministic biautomata

Galina Jirásková and Ondřej Klíma
Information and Computation 286 104778 (2022)
DOI: 10.1016/j.ic.2021.104778
See this article