State complexity of cyclic shift
Article Properties
-
DOI (url)
-
Publication Date2007/12/13
-
Indian UGC (journal)
-
Refrences24
-
Citations18
-
Galina Jirásková
-
Alexander Okhotin
Cite
Jirásková, Galina, and Alexander Okhotin. “State Complexity of Cyclic Shift”. RAIRO - Theoretical Informatics and Applications, vol. 42, no. 2, 2007, pp. 335-60, https://doi.org/10.1051/ita:2007038.
Jirásková, G., & Okhotin, A. (2007). State complexity of cyclic shift. RAIRO - Theoretical Informatics and Applications, 42(2), 335-360. https://doi.org/10.1051/ita:2007038
Jirásková G, Okhotin A. State complexity of cyclic shift. RAIRO - Theoretical Informatics and Applications. 2007;42(2):335-60.
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
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| State complexity of combined operations | Theoretical Computer Science |
| 33 | 2007 |
| State complexity of some operations on binary regular languages | Theoretical Computer Science |
| 44 | 2005 |
| 10.1142/S0129054105003455 | International Journal of Foundations of Computer Science |
| 2005 | |
| On the state complexity of reversals of regular languages | Theoretical Computer Science |
| 31 | 2004 |
| 10.1142/S0129054103002199 | International Journal of Foundations of Computer Science |
| 2003 |
Refrences Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 8
is the most frequently represented among the references in this article. It primarily includes studies from Information Processing Letters The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Nondeterministic operational complexity in subregular languages | Theoretical Computer Science |
| 2023 | |
Operational complexity and pumping lemmas | Acta Informatica |
| 1 | 2022 |
| Maximal state complexity and generalized de Bruijn words | Information and Computation |
| 2022 | |
| Counting (Watson-Crick) palindromes in Watson-Crick conjugates | Information and Computation |
| 1 | 2022 |
| Combination of roots and boolean operations: An application to state complexity | Information and Computation |
| 2022 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 18
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled State complexity of combined operations and was published in 2007. The most recent citation comes from a 2023 study titled Nondeterministic operational complexity in subregular languages. This article reached its peak citation in 2022, with 4 citations. It has been cited in 5 different journals, 20% of which are open access. Among related journals, the Theoretical Computer Science cited this research the most, with 6 citations. The chart below illustrates the annual citation trends for this article.