Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Gawrychowski, Paweł
and
Jeż, Artur
2009.
Mathematical Foundations of Computer Science 2009.
Vol. 5734,
Issue. ,
p.
356.
BADR, ANDREW
2009.
HYPER-MINIMIZATION IN O(n2).
International Journal of Foundations of Computer Science,
Vol. 20,
Issue. 04,
p.
735.
Holzer, Markus
and
Maletti, Andreas
2009.
Implementation and Application of Automata.
Vol. 5642,
Issue. ,
p.
4.
Holzer, Markus
and
Maletti, Andreas
2010.
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton.
Theoretical Computer Science,
Vol. 411,
Issue. 38-39,
p.
3404.
MALETTI, ANDREAS
and
QUERNHEIM, DANIEL
2011.
OPTIMAL HYPER-MINIMIZATION.
International Journal of Foundations of Computer Science,
Vol. 22,
Issue. 08,
p.
1877.
Gawrychowski, Paweł
Jeż, Artur
and
Maletti, Andreas
2011.
Mathematical Foundations of Computer Science 2011.
Vol. 6907,
Issue. ,
p.
327.
Maletti, Andreas
2011.
Implementation and Application of Automata.
Vol. 6482,
Issue. ,
p.
201.
Jeż, Artur
and
Maletti, Andreas
2011.
Implementation and Application of Automata.
Vol. 6807,
Issue. ,
p.
203.
Jeż, Artur
and
Maletti, Andreas
2012.
Implementation and Application of Automata.
Vol. 7381,
Issue. ,
p.
217.
Björklund, Henrik
and
Martens, Wim
2012.
The tractability frontier for NFA minimization.
Journal of Computer and System Sciences,
Vol. 78,
Issue. 1,
p.
198.
MALETTI, ANDREAS
and
QUERNHEIM, DANIEL
2012.
UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION.
International Journal of Foundations of Computer Science,
Vol. 23,
Issue. 06,
p.
1207.
Holzer, Markus
and
Jakobi, Sebastian
2012.
Developments in Language Theory.
Vol. 7410,
Issue. ,
p.
190.
Holzer, Markus
and
Jakobi, Sebastian
2013.
Implementation and Application of Automata.
Vol. 7982,
Issue. ,
p.
181.
JEŻ, ARTUR
and
MALETTI, ANDREAS
2013.
HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA.
International Journal of Foundations of Computer Science,
Vol. 24,
Issue. 06,
p.
815.
Maletti, Andreas
2013.
Implementation and Application of Automata.
Vol. 7982,
Issue. ,
p.
244.
Holzer, Markus
and
Jakobi, Sebastian
2014.
Descriptional Complexity of Formal Systems.
Vol. 8614,
Issue. ,
p.
162.
Holzer, Markus
and
Jakobi, Sebastian
2014.
More Structural Characterizations of Some Subregular Language Families by Biautomata.
Electronic Proceedings in Theoretical Computer Science,
Vol. 151,
Issue. ,
p.
271.
Maletti, Andreas
and
Quernheim, Daniel
2014.
Hyper-Minimization for Deterministic Weighted Tree Automata.
Electronic Proceedings in Theoretical Computer Science,
Vol. 151,
Issue. ,
p.
314.
Maletti, Andreas
2015.
Hyper-optimization for deterministic tree automata.
Theoretical Computer Science,
Vol. 578,
Issue. ,
p.
72.
Nakamura, Yoshiki
2016.
The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities.
Electronic Proceedings in Theoretical Computer Science,
Vol. 226,
Issue. ,
p.
272.