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

Developments in Language Theory

Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson and Denis Thérien
Lecture Notes in Computer Science, Developments in Language Theory 3340 89 (2004)
DOI: 10.1007/978-3-540-30550-7_8
See this article

Hierarchies and reducibilities on regular languages related to modulo counting

Victor L. Selivanov
RAIRO - Theoretical Informatics and Applications 43 (1) 95 (2009)
DOI: 10.1051/ita:2007063
See this article

Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies

Victor L. Selivanov
RAIRO - Theoretical Informatics and Applications 36 (1) 29 (2002)
DOI: 10.1051/ita:2002003
See this article

Languages polylog-time reducible to dot-depth 1/2

Christian Glaßer
Journal of Computer and System Sciences 73 (1) 36 (2007)
DOI: 10.1016/j.jcss.2006.09.004
See this article

A reducibility for the dot-depth hierarchy

Victor L. Selivanov and Klaus W. Wagner
Theoretical Computer Science 345 (2-3) 448 (2005)
DOI: 10.1016/j.tcs.2005.07.020
See this article

THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS

BERND BORCHERT, KLAUS-JÖRN LANGE, FRANK STEPHAN, PASCAL TESSON and DENIS THÉRIEN
International Journal of Foundations of Computer Science 16 (04) 625 (2005)
DOI: 10.1142/S0129054105003200
See this article

Machines that Can Output Empty Words

Christian Glaßer and Stephen Travers
Theory of Computing Systems 44 (3) 369 (2009)
DOI: 10.1007/s00224-007-9087-5
See this article

Autoreducibility, mitoticity, and immunity

Christian Glaßer, Mitsunori Ogihara, A. Pavan, Alan L. Selman and Liyu Zhang
Journal of Computer and System Sciences 73 (5) 735 (2007)
DOI: 10.1016/j.jcss.2006.10.020
See this article

Fine hierarchies and m-reducibilities in theoretical computer science

Victor L. Selivanov
Theoretical Computer Science 405 (1-2) 116 (2008)
DOI: 10.1016/j.tcs.2008.06.031
See this article

Perfect correspondences between dot-depth and polynomial-time hierarchies

Christian Glaßer, Stephen Travers and Klaus W. Wagner
Journal of Computer and System Sciences 80 (7) 1359 (2014)
DOI: 10.1016/j.jcss.2014.03.006
See this article

Developments in Language Theory

Christian Glaßer, Stephen Travers and Klaus W. Wagner
Lecture Notes in Computer Science, Developments in Language Theory 4036 408 (2006)
DOI: 10.1007/11779148_37
See this article

STACS 2005

Christian Glaßer
Lecture Notes in Computer Science, STACS 2005 3404 170 (2005)
DOI: 10.1007/978-3-540-31856-9_14
See this article

Machines, Computations, and Universality

Klaus W. Wagner
Lecture Notes in Computer Science, Machines, Computations, and Universality 3354 60 (2005)
DOI: 10.1007/978-3-540-31834-7_5
See this article

Mathematical Foundations of Computer Science 2004

Victor L. Selivanov and Klaus W. Wagner
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2004 3153 783 (2004)
DOI: 10.1007/978-3-540-28629-5_61
See this article

Mathematical Foundations of Computer Science 2006

Christian Glaßer and Stephen Travers
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2006 4162 436 (2006)
DOI: 10.1007/11821069_38
See this article

New Computational Paradigms

Victor L. Selivanov
Lecture Notes in Computer Science, New Computational Paradigms 3526 430 (2005)
DOI: 10.1007/11494645_53
See this article