Hierarchies and reducibilities on regular languages related to modulo counting
RAIRO-Theor. Inf. Appl., 43 1 (2009) 95-132
Published online: 2008-01-15
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):
15764 425 (2025)
https://doi.org/10.1007/978-3-031-95908-0_30
13967 190 (2023)
https://doi.org/10.1007/978-3-031-36978-0_16
13967 141 (2023)
https://doi.org/10.1007/978-3-031-36978-0_12
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Victor SelivanovTrends in Logic, Well-Quasi Orders in Computation, Logic, Language and Reasoning 53 271 (2020)
https://doi.org/10.1007/978-3-030-30229-0_10
11612 235 (2019)
https://doi.org/10.1007/978-3-030-23247-4_18
Pursuit of the Universal
Anton Konovalov and Victor SelivanovLecture Notes in Computer Science, Pursuit of the Universal 9709 292 (2016)
https://doi.org/10.1007/978-3-319-40189-8_30
Efficient algorithms for membership in boolean hierarchies of regular languages
Christian Glaßer, Heinz Schmitz and Victor SelivanovTheoretical Computer Science 646 86 (2016)
https://doi.org/10.1016/j.tcs.2016.07.017
Boolean Algebras of Regular Languages
A. S. Konovalov* and V. L. Selivanov* **Algebra and Logic 52 (6) 448 (2014)
https://doi.org/10.1007/s10469-014-9260-2
Fine hierarchies via Priestley duality
Victor SelivanovAnnals of Pure and Applied Logic 163 (8) 1075 (2012)
https://doi.org/10.1016/j.apal.2011.12.029
Fine hierarchies and m-reducibilities in theoretical computer science
Victor L. SelivanovTheoretical Computer Science 405 (1-2) 116 (2008)
https://doi.org/10.1016/j.tcs.2008.06.031