Two-variable logic on data words
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2011/07/01
-
Indian UGC (journal)
-
Refrences29
-
Citations37
-
Mikołaj Bojańczyk Warsaw University, Warsaw, Poland
-
Claire David LIAFA, Paris VII, France
-
Anca Muscholl Bordeaux University, Talence Cedex, France
-
Thomas Schwentick TU Dortmund, Dortmund, Germany
-
Luc Segoufin INRIA, Cachan Cedex, France
Abstract
Cite
Bojańczyk, Mikołaj, et al. “Two-Variable Logic on Data Words”. ACM Transactions on Computational Logic, vol. 12, no. 4, 2011, pp. 1-26, https://doi.org/10.1145/1970398.1970403.
Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., & Segoufin, L. (2011). Two-variable logic on data words. ACM Transactions on Computational Logic, 12(4), 1-26. https://doi.org/10.1145/1970398.1970403
Bojańczyk M, David C, Muscholl A, Schwentick T, Segoufin L. Two-variable logic on data words. ACM Transactions on Computational Logic. 2011;12(4):1-26.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Structure theorem and strict alternation hierarchy for FO2 on words | 2009 | |||
| Decidability issues for Petri nets—a survey | 1994 | |||
| Proceedings of the 5th International Conference on Developments in Language Theory (DLT'01) | ||||
| Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07) | ||||
| Proceedings of the 32nd Mathematical Foundations of Computer Science International Symposium (MFCS'07) |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Realizability problem for constraint LTL | Information and Computation |
| 2024 | |
Round- and context-bounded control of dynamic pushdown systems | Formal Methods in System Design |
| 2023 | |
| A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Register Automata | IEICE Transactions on Information and Systems |
| 2023 | |
| A Uniform One-Dimensional Fragment with Alternation of Quantifiers | Electronic Proceedings in Theoretical Computer Science |
| 2023 | |
| Complexity results on register context-free grammars and related formalisms | Theoretical Computer Science |
| 2022 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 32
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled k-counting automata and was published in 2012. The most recent citation comes from a 2024 study titled Realizability problem for constraint LTL. This article reached its peak citation in 2016, with 6 citations. It has been cited in 18 different journals, 5% of which are open access. Among related journals, the Electronic Proceedings in Theoretical Computer Science cited this research the most, with 5 citations. The chart below illustrates the annual citation trends for this article.