I THINK SEARCH

¿Cómo alguien que llega por primera vez a una ciudad cuyas calles no tienen nombre puede encontrar una casa con indicaciones de “ahora a la izquierda, ahora a la derecha”?

Este es un tema verdademente apasionante. He recopilado estas fuentes para aquellos que esten interesados.

 www.ithinksearch.com/Avraham_Trakhtman.pdf

The Jerusalem PostStuart W. Margolis     
סטוארט מרגוליס

Referencias sobre Biliografia sobre  Road Coloring

1. Seigel-Itzkovich, Judy. “Russian immigrant solves math puzzle“, The Jerusalem Post, 2008-02-08. Retrieved on 2008-03-21. 
2. Heller, Aron. “After 38 years, Israeli solves math code“, Yahoo! News, 2008-03-20. Retrieved on 2008-03-21. 
3. Trahtman, Avraham. The road coloring problem. Retrieved on 2008-03-21.
4. http://www.emis.de/journals/DMTCS/pdfpapers/dmAE0155.pdf
5. Jarkko Kari, “Synchronizing finite automata on Eulerian digraphs”, Theoretical Computer Science 295 (2003), 223–232.
6. G. L. O’Brien, “The road-coloring problem”, Israel Journal of Mathematics, Vol. 39, 1981.

[1] R.L. Adler, L.W. Goodwyn, B. Weiss. Equivalence of topological Markov
shifts, Israel J. of Math. 27(1977), 49-63.
[2] R.L. Adler, B. Weiss. Similarity of automorphisms of the torus, Memoirs
of the Amer. Math. Soc., Providence, RI, 98(1970).
[3] G. Budzban, A. Mukherjea. A semigroup approach to the Road Coloring
Problem, Probability on Algebraic Structures. ContemporaryMathematics,
261(2000), 195-207.
[4] A. Carbone. Cycles of relatively prime length and the road coloring problem,
Israel J. of Math., 123(2001), 303-316.
[5] K. Culik II, J. Karhumaki, J. Kari. A note on synchronized automata and
Road Coloring Problem, Developments in Language Theory (5th Int. Conf.,
Vienna, 2001), Lecture Notes in Computer Science, 2295(2002), 175-185.
[6] J. Friedman. On the road coloring problem, Proc. of the Amer. Math. Soc.
110(1990), 1133-1135.
[7] E. Gocka, W. Kirchherr, E. Schmeichel, A note on the road-coloring conjecture.
Ars Combin. 49(1998), 265-270.
[8] R. Hegde, K. Jain, Min-Max theorem about the Road Coloring Conjecture
EuroComb 2005, DMTCS proc., AE, 2005, 279 - 284.
[9] N. Jonoska, S. Suen. Monocyclic decomposition of graphs and the road coloring
problem, Congressum numerantium, 110(1995), 201-209.
[10] J. Kari. Synchronizing finite automata on Eulerian digraphs, Springer, Lect.
Notes in Comp. Sci., 2136(2001), 432-438.
[11] D. Lind, B. Marcus. An Introduction of Symbolic Dynamics and Coding,
Cambridge Univ. Press, 1995.
[12] A. Mateescu, A. Salomaa, Many-Valued Truth Functions, ˇ Cerny’s Conjecture
and Road Coloring, Bull. of European Ass. for TCS, 68(1999), 134-148.
[13] G.L. O’Brien. The road coloring problem, Israel J. of Math., 39(1981), 145-
154.

Share This

This entry was posted on Friday, April 4th, 2008 at 8:29 am and is filed under Search Intelligence. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.