Decision problems among the main subfamilies of rational relations
RAIRO-Theor. Inf. Appl., 40 2 (2006) 255-275
Published online: 2006-07-20
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):
1 (2023)
https://doi.org/10.1109/LICS56636.2023.10175722
Solving string constraints with Regex-dependent functions through transducers with priorities and variables
Taolue Chen, Alejandro Flores-Lamas, Matthew Hague, et al.Proceedings of the ACM on Programming Languages 6 (POPL) 1 (2022)
https://doi.org/10.1145/3498707
1 (2022)
https://doi.org/10.1145/3531130.3533346
Computer Aided Verification
Oliver Markgraf, Daniel Stan and Anthony W. LinLecture Notes in Computer Science, Computer Aided Verification 12760 243 (2021)
https://doi.org/10.1007/978-3-030-81688-9_12
Automated Reasoning
Matthew Hague, Anthony W. Lin, Philipp Rümmer and Zhilin WuLecture Notes in Computer Science, Automated Reasoning 12166 122 (2020)
https://doi.org/10.1007/978-3-030-51074-9_8
Decision procedures for path feasibility of string-manipulating programs with complex operations
Taolue Chen, Matthew Hague, Anthony W. Lin, Philipp Rümmer and Zhilin WuProceedings of the ACM on Programming Languages 3 (POPL) 1 (2019)
https://doi.org/10.1145/3290362
Monadic Decomposition
Margus Veanes, Nikolaj Bjørner, Lev Nachmanson and Sergey BeregJournal of the ACM 64 (2) 1 (2017)
https://doi.org/10.1145/3040488
Fundamentals of Computation Theory
Christof Löding and Christopher SpinrathLecture Notes in Computer Science, Fundamentals of Computation Theory 10472 341 (2017)
https://doi.org/10.1007/978-3-662-55751-8_27
String solving with word equations and transducers: towards a logic for analysing mutation XSS
Anthony W. Lin and Pablo BarcelóACM SIGPLAN Notices 51 (1) 123 (2016)
https://doi.org/10.1145/2914770.2837641
Synchronizing Relations on Words
Diego Figueira and Leonid LibkinTheory of Computing Systems 57 (2) 287 (2015)
https://doi.org/10.1007/s00224-014-9584-2
Uniform strategies, rational relations and jumping automata
Laura Bozzelli, Bastien Maubert and Sophie PinchinatInformation and Computation 242 80 (2015)
https://doi.org/10.1016/j.ic.2015.03.012
115 (2012)
https://doi.org/10.1109/LICS.2012.23
Preface
Christian Choffrut and Loïc ColsonRAIRO - Theoretical Informatics and Applications 42 (1) 1 (2008)
https://doi.org/10.1051/ita:2007056
SOFSEM 2008: Theory and Practice of Computer Science
Frank G. RadmacherLecture Notes in Computer Science, SOFSEM 2008: Theory and Practice of Computer Science 4910 424 (2008)
https://doi.org/10.1007/978-3-540-77566-9_37
Deciding whether a relation defined in Presburger logic can be defined in weaker logics
Christian ChoffrutRAIRO - Theoretical Informatics and Applications 42 (1) 121 (2008)
https://doi.org/10.1051/ita:2007047