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

Hyper-optimization for deterministic tree automata

Andreas Maletti
Theoretical Computer Science 578 72 (2015)
DOI: 10.1016/j.tcs.2015.01.020
See this article

Implementation and Application of Automata

Markus Holzer and Andreas Maletti
Lecture Notes in Computer Science, Implementation and Application of Automata 5642 4 (2009)
DOI: 10.1007/978-3-642-02979-0_4
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

Hyper-Minimization for Deterministic Weighted Tree Automata

Andreas Maletti and Daniel Quernheim
Electronic Proceedings in Theoretical Computer Science 151 314 (2014)
DOI: 10.4204/EPTCS.151.22
See this article

An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton

Markus Holzer and Andreas Maletti
Theoretical Computer Science 411 (38-39) 3404 (2010)
DOI: 10.1016/j.tcs.2010.05.029
See this article

Implementation and Application of Automata

Andreas Maletti
Lecture Notes in Computer Science, Implementation and Application of Automata 6482 201 (2011)
DOI: 10.1007/978-3-642-18098-9_22
See this article

UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION

ANDREAS MALETTI and DANIEL QUERNHEIM
International Journal of Foundations of Computer Science 23 (06) 1207 (2012)
DOI: 10.1142/S0129054112400485
See this article

HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA

ARTUR JEŻ and ANDREAS MALETTI
International Journal of Foundations of Computer Science 24 (06) 815 (2013)
DOI: 10.1142/S0129054113400200
See this article

The tractability frontier for NFA minimization

Henrik Björklund and Wim Martens
Journal of Computer and System Sciences 78 (1) 198 (2012)
DOI: 10.1016/j.jcss.2011.03.001
See this article

Implementation and Application of Automata

Artur Jeż and Andreas Maletti
Lecture Notes in Computer Science, Implementation and Application of Automata 6807 203 (2011)
DOI: 10.1007/978-3-642-22256-6_19
See this article

Boundary sets of regular and context-free languages

Markus Holzer and Sebastian Jakobi
Theoretical Computer Science 610 59 (2016)
DOI: 10.1016/j.tcs.2015.07.032
See this article

Building Efficient and Compact Data Structures for Simplicial Complexes

Jean-Daniel Boissonnat, Karthik C. S. and Sébastien Tavenas
Algorithmica 79 (2) 530 (2017)
DOI: 10.1007/s00453-016-0207-y
See this article

The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities

Yoshiki Nakamura
Electronic Proceedings in Theoretical Computer Science 226 272 (2016)
DOI: 10.4204/EPTCS.226.19
See this article

HYPER-MINIMIZATION IN O(n2)

ANDREW BADR
International Journal of Foundations of Computer Science 20 (04) 735 (2009)
DOI: 10.1142/S012905410900684X
See this article

OPTIMAL HYPER-MINIMIZATION

ANDREAS MALETTI and DANIEL QUERNHEIM
International Journal of Foundations of Computer Science 22 (08) 1877 (2011)
DOI: 10.1142/S0129054111009094
See this article

Mathematical Foundations of Computer Science 2009

Paweł Gawrychowski and Artur Jeż
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2009 5734 356 (2009)
DOI: 10.1007/978-3-642-03816-7_31
See this article

Mathematical Foundations of Computer Science 2011

Paweł Gawrychowski, Artur Jeż and Andreas Maletti
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2011 6907 327 (2011)
DOI: 10.1007/978-3-642-22993-0_31
See this article