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

Boolean Algebras of Regular Languages

A. S. Konovalov* and V. L. Selivanov* **
Algebra and Logic 52 (6) 448 (2014)
DOI: 10.1007/s10469-014-9260-2
See this article

Fine hierarchies via Priestley duality

Victor Selivanov
Annals of Pure and Applied Logic 163 (8) 1075 (2012)
DOI: 10.1016/j.apal.2011.12.029
See this article

Well-Quasi Orders in Computation, Logic, Language and Reasoning

Victor Selivanov
Trends in Logic, Well-Quasi Orders in Computation, Logic, Language and Reasoning 53 271 (2020)
DOI: 10.1007/978-3-030-30229-0_10
See this article

Descriptional Complexity of Formal Systems

Mizuhito Ogawa and Victor Selivanov
Lecture Notes in Computer Science, Descriptional Complexity of Formal Systems 11612 235 (2019)
DOI: 10.1007/978-3-030-23247-4_18
See this article

Pursuit of the Universal

Anton Konovalov and Victor Selivanov
Lecture Notes in Computer Science, Pursuit of the Universal 9709 292 (2016)
DOI: 10.1007/978-3-319-40189-8_30
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

Efficient algorithms for membership in boolean hierarchies of regular languages

Christian Glaßer, Heinz Schmitz and Victor Selivanov
Theoretical Computer Science 646 86 (2016)
DOI: 10.1016/j.tcs.2016.07.017
See this article