Hardness of conjugacy, embedding and factorization of multidimensional subshifts
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2015/12/01
-
Indian UGC (journal)
-
Refrences18
-
Citations4
-
Emmanuel Jeandel
-
Pascal Vanier
Cite
Jeandel, Emmanuel, and Pascal Vanier. “Hardness of Conjugacy, Embedding and Factorization of Multidimensional Subshifts”. Journal of Computer and System Sciences, vol. 81, no. 8, 2015, pp. 1648-64, https://doi.org/10.1016/j.jcss.2015.05.003.
Jeandel, E., & Vanier, P. (2015). Hardness of conjugacy, embedding and factorization of multidimensional subshifts. Journal of Computer and System Sciences, 81(8), 1648-1664. https://doi.org/10.1016/j.jcss.2015.05.003
Jeandel, Emmanuel, and Pascal Vanier. “Hardness of Conjugacy, Embedding and Factorization of Multidimensional Subshifts”. Journal of Computer and System Sciences 81, no. 8 (2015): 1648-64. https://doi.org/10.1016/j.jcss.2015.05.003.
Jeandel E, Vanier P. Hardness of conjugacy, embedding and factorization of multidimensional subshifts. Journal of Computer and System Sciences. 2015;81(8):1648-64.
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 |
|---|---|---|---|---|
| On the subsystems of topological Markov chains | 1982 | |||
| On the dynamics and recursive properties of multidimensional symbolic systems | Inventiones mathematicae |
| 40 | 2009 |
| A note on universality in multidimensional symbolic dynamics | Discrete & Continuous Dynamical Systems - S | 1 | 2009 | |
| Open problems in symbolic dynamics | Contemporary Mathematics |
| 2008 | |
| Lower entropy factors of sofic systems | 1983 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings | Theory of Computing Systems |
| 2023 | |
| Computational complexity of k-block conjugacy | Theoretical Computer Science |
| 2 | 2021 |
| Decidability of Irreducible Tree Shifts of Finite Type | Journal of Statistical Physics |
| 3 | 2019 |
Optimal state amalgamation is NP-hard | Ergodic Theory and Dynamical Systems |
| 2 | 2017 |
Citations Analysis
The category
Science: Mathematics 3
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Optimal state amalgamation is NP-hard and was published in 2017. The most recent citation comes from a 2023 study titled Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings. This article reached its peak citation in 2023, with 1 citations. It has been cited in 4 different journals. Among related journals, the Theory of Computing Systems cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.