Theories of orders on the set of words
RAIRO-Theor. Inf. Appl., 40 1 (2006) 53-74
Published online: 2005-10-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):
14617 44 (2024)
https://doi.org/10.1007/978-3-031-66438-0_3
Alternating complexity of counting first-order logic for the subword order
Dietrich Kuske and Christian SchwarzActa Informatica 60 (1) 79 (2023)
https://doi.org/10.1007/s00236-022-00424-2
Complexity in Young's lattice
Alexander WiresAnnals of Pure and Applied Logic 173 (4) 103075 (2022)
https://doi.org/10.1016/j.apal.2021.103075
Concrete domains in logics
Stéphane Demri and Karin QuaasACM SIGLOG News 8 (3) 6 (2021)
https://doi.org/10.1145/3477986.3477988
Definability in first-order theories of graph orderings ⋆
Ramanathan S Thinniyam and R RamanujamJournal of Logic and Computation 30 (1) 403 (2020)
https://doi.org/10.1093/logcom/exaa017
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
Computer Science – Theory and Applications
Dietrich KuskeLecture Notes in Computer Science, Computer Science – Theory and Applications 12159 289 (2020)
https://doi.org/10.1007/978-3-030-50026-9_21
11425 348 (2019)
https://doi.org/10.1007/978-3-030-17127-8_20
1 (2017)
https://doi.org/10.1109/LICS.2017.8005141
Logic and Its Applications
Ramanathan S. ThinniyamLecture Notes in Computer Science, Logic and Its Applications 10119 211 (2017)
https://doi.org/10.1007/978-3-662-54069-5_16
Logical Foundations of Computer Science
R. Ramanujam and R. S. ThinniyamLecture Notes in Computer Science, Logical Foundations of Computer Science 9537 331 (2016)
https://doi.org/10.1007/978-3-319-27683-0_23
Temporal logics on strings with prefix relation
Stéphane Demri and Morgan DetersJournal of Logic and Computation 26 (3) 989 (2016)
https://doi.org/10.1093/logcom/exv028
On the Homomorphism Order of Labeled Posets
Léonard Kwuida and Erkko LehtonenOrder 28 (2) 251 (2011)
https://doi.org/10.1007/s11083-010-9169-x
Definability of closure operations in the h-quasiorder of labeled forests
A. V. Zhukov, O. V. Kudinov and V. L. SelivanovAlgebra and Logic 49 (2) 120 (2010)
https://doi.org/10.1007/s10469-010-9084-7
Definability in the structure of words with the inclusion relation
Oleg V. Kudinov, Victor L. Selivanov and Lyudmila V. YartsevaSiberian Mathematical Journal 51 (3) 456 (2010)
https://doi.org/10.1007/s11202-010-0047-y
Programs, Proofs, Processes
Oleg V. Kudinov, Victor L. Selivanov and Lyudmila V. YartsevaLecture Notes in Computer Science, Programs, Proofs, Processes 6158 246 (2010)
https://doi.org/10.1007/978-3-642-13962-8_28
Mathematical Theory and Computational Practice
Oleg V. Kudinov and Victor L. SelivanovLecture Notes in Computer Science, Mathematical Theory and Computational Practice 5635 290 (2009)
https://doi.org/10.1007/978-3-642-03073-4_30
Developments in Language Theory
Oleg V. Kudinov and Victor L. SelivanovLecture Notes in Computer Science, Developments in Language Theory 5583 454 (2009)
https://doi.org/10.1007/978-3-642-02737-6_37
Definability in the h-quasiorder of labeled forests
Oleg V. Kudinov, Victor L. Selivanov and Anton V. ZhukovAnnals of Pure and Applied Logic 159 (3) 318 (2009)
https://doi.org/10.1016/j.apal.2008.09.026
Undecidability in Some Structures Related to Computation Theory
V. L. SelivanovJournal of Logic and Computation 19 (1) 177 (2009)
https://doi.org/10.1093/logcom/exn023
Labeled posets are universal
Erkko LehtonenEuropean Journal of Combinatorics 29 (2) 493 (2008)
https://doi.org/10.1016/j.ejc.2007.02.005
Language and Automata Theory and Applications
Jan-Henrik AltenberndLecture Notes in Computer Science, Language and Automata Theory and Applications 5196 40 (2008)
https://doi.org/10.1007/978-3-540-88282-4_6
The quotient algebra of labeled forests modulo h-equivalence
V. L. SelivanovAlgebra and Logic 46 (2) 120 (2007)
https://doi.org/10.1007/s10469-007-0011-5
Computation and Logic in the Real World
Oleg V. Kudinov and Victor L. SelivanovLecture Notes in Computer Science, Computation and Logic in the Real World 4497 436 (2007)
https://doi.org/10.1007/978-3-540-73001-9_45
Logical Approaches to Computational Barriers
Oleg V. Kudinov and Victor L. SelivanovLecture Notes in Computer Science, Logical Approaches to Computational Barriers 3988 289 (2006)
https://doi.org/10.1007/11780342_31