Savitch, W.: Relationships between nondeterministic and deterministic tape complexities, J. Olschewski, J., Ummels, M.: The complexity of finding reset words in finite automata. Martyugin, P.: Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata. Lovász, L.: On the ratio of optimal integral and fractional covers. Gerbush, M., Heeringa, B.: Approximating minimum reset sequences. Springer, Heidelberg (2011)Įppstein, D.: Reset sequences for monotonic automata. Syst. 54(2), 211–223 (2014)īonizzoni, P., Jonoska, N.: Regular splicing languages must have a constant. Algorithms 2(2), 153–177 (2006)īerlinkov, M.: Approximating the minimum length of synchronizing words is hard. (N.S.Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions.
#Otomata not working free
Świerczkowski, A class of free rotation groups, Indag. Świerczkowski, On a free group of rotations of the Euclidean space, Nederl. Toshikazu Sunada, The Banach‐Tarski paradox-the far side of infinity, Sūgaku, 50 ( 1998), 86–97 2000c:03002 Google Scholar Renegar, On the computational complexity and geometry of the first‐order theory of the reals.
Michael Rabin, Mathematical theory of automata, Amer. Emil Post, A variant of a recursively unsolvable problem, Bull. Azaria Paz, Introduction to probabilistic automata, Academic Press, 1971xxv+228 MR0289222 Google Scholar Yuri Matiyasevich and , Géraud Sénizergues, Decision problems for semi‐Thue systems with a few rules, Theoret. Cristopher Moore and , James Crutchfield, Quantum automata and quantum grammars, Theoret. Harm Derksen , , Emmanuel Jeandel and , Pascal Koiran, Quantum automata and algebraic groups, J. David Deutsch , , Adriano Barenco and , Artur Ekert, Universality in quantum computation, Proc. David Cox , , John Little and , Donal O’Shea, Ideals, varieties, and algorithms, Undergraduate Texts in Mathematics, Springer‐Verlag, 1997xiv+536, An introduction to computational algebraic geometry and commutative algebra 97h:13024 Crossref Google Scholar Vincent Blondel and , John Tsitsiklis, When is a pair of matrices mortal?, Inform. Alex Brodsky and , Nicholas Pippenger, Characterizations of 1‐way quantum finite automata, SIAM J. Torelli, Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata, Springer, Berlin, 1977, 0–0, 87–94.
Bertoni, The solution of problems relative to probabilistic automata in the frame of the formal languages theory, Springer, Berlin, 1975, 0–0, 107–112. Vincent Blondel and , Vincent Canterini, Undecidable problems for probabilistic automata of fixed dimension, Theory Comput. Saugata Basu , , Richard Pollack and , Marie‐Françoise Roy, On the combinatorial and algebraic complexity of quantifier elimination, J. Weinfurter, Elementary gates for quantum computation, Phys. Masami Amano and , Kazuo Iwama, Undecidability on quantum finite automata, ACM, New York, 1999, 368–375 2001h:68034 Google Scholar
0 kommentar(er)
