On Existentially First-Order Definable Languages and Their Relation to NP
RAIRO-Theor. Inf. Appl., 33 3 (1999) 259-269
Published online: 2002-08-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):
Perfect correspondences between dot-depth and polynomial-time hierarchies
Christian Glaßer, Stephen Travers and Klaus W. WagnerJournal of Computer and System Sciences 80 (7) 1359 (2014)
https://doi.org/10.1016/j.jcss.2014.03.006
Machines that Can Output Empty Words
Christian Glaßer and Stephen TraversTheory of Computing Systems 44 (3) 369 (2009)
https://doi.org/10.1007/s00224-007-9087-5
Hierarchies and reducibilities on regular languages related to modulo counting
Victor L. SelivanovRAIRO - Theoretical Informatics and Applications 43 (1) 95 (2009)
https://doi.org/10.1051/ita:2007063
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
Autoreducibility, mitoticity, and immunity
Christian Glaßer, Mitsunori Ogihara, A. Pavan, Alan L. Selman and Liyu ZhangJournal of Computer and System Sciences 73 (5) 735 (2007)
https://doi.org/10.1016/j.jcss.2006.10.020
Languages polylog-time reducible to dot-depth 1/2
Christian GlaßerJournal of Computer and System Sciences 73 (1) 36 (2007)
https://doi.org/10.1016/j.jcss.2006.09.004
Mathematical Foundations of Computer Science 2006
Christian Glaßer and Stephen TraversLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2006 4162 436 (2006)
https://doi.org/10.1007/11821069_38
Developments in Language Theory
Christian Glaßer, Stephen Travers and Klaus W. WagnerLecture Notes in Computer Science, Developments in Language Theory 4036 408 (2006)
https://doi.org/10.1007/11779148_37
New Computational Paradigms
Victor L. SelivanovLecture Notes in Computer Science, New Computational Paradigms 3526 430 (2005)
https://doi.org/10.1007/11494645_53
Machines, Computations, and Universality
Klaus W. WagnerLecture Notes in Computer Science, Machines, Computations, and Universality 3354 60 (2005)
https://doi.org/10.1007/978-3-540-31834-7_5
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ÉRIENInternational Journal of Foundations of Computer Science 16 (04) 625 (2005)
https://doi.org/10.1142/S0129054105003200
A reducibility for the dot-depth hierarchy
Victor L. Selivanov and Klaus W. WagnerTheoretical Computer Science 345 (2-3) 448 (2005)
https://doi.org/10.1016/j.tcs.2005.07.020
STACS 2005
Christian GlaßerLecture Notes in Computer Science, STACS 2005 3404 170 (2005)
https://doi.org/10.1007/978-3-540-31856-9_14
Mathematical Foundations of Computer Science 2004
Victor L. Selivanov and Klaus W. WagnerLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2004 3153 783 (2004)
https://doi.org/10.1007/978-3-540-28629-5_61
Developments in Language Theory
Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson and Denis ThérienLecture Notes in Computer Science, Developments in Language Theory 3340 89 (2004)
https://doi.org/10.1007/978-3-540-30550-7_8
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
Victor L. SelivanovRAIRO - Theoretical Informatics and Applications 36 (1) 29 (2002)
https://doi.org/10.1051/ita:2002003