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

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

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

FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES

VICTOR SELIVANOV
International Journal of Foundations of Computer Science 19 (03) 649 (2008)
DOI: 10.1142/S0129054108005875
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

Logic and Theory of Algorithms

Victor L. Selivanov and Klaus W. Wagner
Lecture Notes in Computer Science, Logic and Theory of Algorithms 5028 533 (2008)
DOI: 10.1007/978-3-540-69407-6_57
See this article

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

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

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