Time and Space Complexity Classes of Hyperbolic Cellular Automata

IEICE Transactions on Information and Systems

Volumn E87-D, Issue 3, 2004, Pages 700-707

  Iwamoto, Chuzo ^a   Margenstern, Maurice ^b  

^a HIROSHIMA UNIVERSITY   (Japan)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Cellular automata; Complexity classes; Hyperbolic space

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

CELLULAR AUTOMATA; COMPLEXITY CLASSES; HYBERBOLIC SPACE;

AUTOMATA THEORY;

EID: 1642372726     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (18)

1. J. Cai and M.D. Hirsch, "Rotation distance, triangulations of planar surfaces and hyperbolic geometry," Proc. ISAAC (LNCS834), pp. 172-180, 1994.
2. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer, "Alternation," J. ACM, vol.28, no.1, pp.207-230, 1981.
3. O.H. Ibarra, S.M. Kim, and S. Moran, "Sequential machine characterizations of trellis and cellular automata and applications," SIAM J. Comput., vol.14, no.2, pp.426-447, 1985.
4. B. Iversen, Hyperbolic Geometry, pp.200, Cambridge Univ. Press, Cambridge, 1993.
5. C. Iwamoto, T. Andou, K. Morita, and K. Imai, "Computational complexity in the hyperbolic plane," Proc. MFCS (LNCS2420), pp.365-374, 2002.
6. C. Iwamoto, T. Hatsuyama, K. Morita, and K. Imai, "Constructible functions in cellular automata and their applications to hierarchy results," Theoret. Comput. Sci., vol.270, no.1/2, pp.797-809, 2002.
7. C. Iwamoto, M. Margenstern, K. Morita, and T. Worsen, "Polynomial-time cellular automata in the hyperbolic plane accept exactly the PSPACE Languages," Multiconference on SCI, pp.411-416, Orlando, FL, 2002.
8. C. Iwamoto and M. Margenstem, "A survey on the complexity classes in hyperbolic cellular automata," Multiconference on SCI, Orlando, FL, 2003.
9. C. Kenyon, E. Mossel, and Y. Peres, "Glauber dynamics on trees and hyperbolic graphs," Proc. IEEE Symp. on Foundations of Computer Science, pp.568-578, 2001.
10. M. Margenstem, "Cellular automata and combinatoric tilings in hyperbolic spaces: A survey," Proc. DMTCS (LNCS2731), pp.48-72, 2003.
11. M. Margenstem, "New tools for cellular automata in the hyperbolic plane," J. UCS, vol.6, no.12, pp.1226-1252, 2000.
12. M. Margenstem and K. Morita, "NP problems are tractable in the space of cellular automata in the hyperbolic plane," Theoret. Comput. Sci., vol.259, no.1/2, pp.99-128, 2001.
13. M. Margenstem and G. Skordev, "Locating cells in regular grids of the hyperbolic plane for cellular automata," Technical Report, no.455, pp.38, Institut für Dynamische Systeme, Universität Bremen, 2000.
14. J. Mazoyer, "A 6-state minimal time solution to the firing squad synchronization problem," Theoret. Comput. Sci., vol.50, pp.183-238, 1987.
15. D. Morgenstein and V. Kreinovich, "Which algorithms are feasible and which are not depends on the geometry of space-time," Geombinatorics, vol.4, no.3, pp.80-97, 1995.
16. A. Ramsay and R.D. Richtmyer, Introduction to Hyperbolic Geometry, pp.290, Springer, Berlin, 1995.
17. R.M. Robinson, "Undecidable tiling problems in the hyperbolic plane," Invent. Math., vol.44, pp.259-264, 1978.
18. W.J. Savitch, "Relationships between nondeterministic and deterministic tape complexities," J. Comput. System Sci., vol.4, pp. 177-192, 1970.