On notions of regularity for data languages
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2010/01/01
-
Journal
-
Indian UGC (journal)
-
Refrences19
-
Citations12
-
Henrik Björklund
-
Thomas Schwentick
Cite
Björklund, Henrik, and Thomas Schwentick. “On Notions of Regularity for Data Languages”. Theoretical Computer Science, vol. 411, no. 4-5, 2010, pp. 702-15, https://doi.org/10.1016/j.tcs.2009.10.009.
Björklund, H., & Schwentick, T. (2010). On notions of regularity for data languages. Theoretical Computer Science, 411(4-5), 702-715. https://doi.org/10.1016/j.tcs.2009.10.009
Björklund H, Schwentick T. On notions of regularity for data languages. Theoretical Computer Science. 2010;411(4-5):702-15.
Journal Categories
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 |
|---|---|---|---|---|
Finite state machines for strings over infinite alphabets | ACM Transactions on Computational Logic |
| 73 | 2004 |
| An algebraic approach to data languages and timed languages | Information and Computation |
| 2003 | |
| Intractability of decision problems for finite-memory automata | Theoretical Computer Science |
| 2000 | |
| Fixed-parameter tractability and completeness II: On completeness for W[1] | Theoretical Computer Science |
| 186 | 1995 |
| Finite-memory automata | Theoretical Computer Science |
| 90 | 1994 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Round- and context-bounded control of dynamic pushdown systems | Formal Methods in System Design |
| 2023 | |
| Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic | Journal of Computer and System Sciences |
| 1 | 2021 |
A Formal Framework for Complex Event Recognition | ACM Transactions on Database Systems |
| 6 | 2021 |
| Streamable regular transductions | Theoretical Computer Science |
| 3 | 2020 |
Game Semantics for Interface Middleweight Java | Journal of the ACM |
| 1 | 2020 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software 10
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Game semantics for interface middleweight Java and was published in 2014. The most recent citation comes from a 2023 study titled Round- and context-bounded control of dynamic pushdown systems. This article reached its peak citation in 2021, with 2 citations. It has been cited in 11 different journals. Among related journals, the Journal of Computer and System Sciences cited this research the most, with 2 citations. The chart below illustrates the annual citation trends for this article.