Filters








1,896 Hits in 5.2 sec

Decision Problems for Restricted Variants of Two-Dimensional Automata [article]

Taylor J. Smith, Kai Salomaa
2019 arXiv   pre-print
We show that the language equivalence problem for two-way deterministic two-dimensional automata is decidable, while both the equivalence and universality problems for two-way nondeterministic two-dimensional  ...  We show that the language emptiness problem for unary three-way nondeterministic two-dimensional automata is NP-complete, and is in P for general-alphabet two-way nondeterministic two-dimensional automata  ...  Conclusion In this paper, we considered decision problems for three-way and two-way two-dimensional automata.  ... 
arXiv:1904.11100v1 fatcat:l7b66z2ogngctafvsefwyzmgbq

Characterizations of 1-Way Quantum Finite Automata

Alex Brodsky, Nicholas Pippenger
2002 SIAM journal on computing (Print)  
We prove several closure properties of the classes of languages accepted by measuremany automata, including inverse homomorphisms, and provide a new necessary condition for a language to be accepted by  ...  We characterize the measure-once model when it is restricted to accepting with bounded error and show that, without that restriction, it can solve the word problem over the free group.  ...  Reversible Finite Automata Unitary operations are reversible, thus QFAs bear strong resemblance to various variants of reversible finite automata.  ... 
doi:10.1137/s0097539799353443 fatcat:uizartdqxzblbbg64uxb5hnx2y

Quantum finite automata: survey, status and research directions [article]

Amandeep Singh Bhatia, Ajay Kumar
2019 arXiv   pre-print
The statistics of quantum finite automata related papers are shown and open problems are identified for more advanced research.  ...  These models are useful for determining the expressive power and boundaries of various computational features.  ...  Acknowledgments Amandeep Singh Bhatia was supported by Maulana Azad National Fellowship (MANF), funded by Ministry of Minority Affairs, Government of India.  ... 
arXiv:1901.07992v1 fatcat:yoxwrd6e55gh3heapwy3w5uuhm

Synthesis, structure and power of systolic computations

Jozef Gruska
1990 Theoretical Computer Science  
Most of the systolic systems have been designed using ad hoc methods and in many cases very similar systolic systems have been designed for seemingly quite different problems.  ...  Systolic systems can be seen as an interesting and useful modification (simplification mostly), of the cellular automata concept of von Neumann, with more emphasis on regularity and transparency of data  ...  (ii) All decision problems menrioned in (i) [and many orher relared problems] are decidable for rhose GFT, row-languages of which are simple semilinear.  ... 
doi:10.1016/0304-3975(90)90190-s fatcat:sztlpeed4jhcdojkzi5z5zyska

Characterizations of 1-Way Quantum Finite Automata [article]

Alex Brodsky, Nicholas Pippenger
2000 arXiv   pre-print
We prove several closure properties of the classes of languages accepted by measure-many automata, including inverse homomorphisms, and provide a new necessary condition for a language to be accepted by  ...  In this paper we study two different models of 1-way quantum finite automata.  ...  Reversible Finite Automata Unitary operations are reversible, thus QFAs bear strong resemblance to various variants of reversible finite automata.  ... 
arXiv:quant-ph/9903014v3 fatcat:egg2icaxz5apbls5agmjra2nse

Hybrid automata with finite bisimulations [chapter]

Thomas A. Henzinger
1995 Lecture Notes in Computer Science  
The analysis, veri cation, and control of hybrid automata with nite bisimulations can be reduced to nite-state problems.  ...  For example, we prove that if two h ybrid automata have nite bisimulations, and both can be calibrated to a common time scale, then their product also has a nite bisimulation.  ...  We also thank Oded Maler and Howard Wong-Toi for valuable comments.  ... 
doi:10.1007/3-540-60084-1_85 fatcat:rgq4jxudqraqddowj7xh4p765e

Foundations of Reversible Computation [chapter]

Bogdan Aman, Gabriel Ciobanu, Robert Glück, Robin Kaarsgaard, Jarkko Kari, Martin Kutrib, Ivan Lanese, Claudio Antares Mezzina, Łukasz Mikulski, Rajagopal Nagarajan, Iain Phillips, G. Michele Pinna (+3 others)
2020 Lecture Notes in Computer Science  
For example, it is not known if the groups of one-dimensional RCA over two states and over three states are isomorphic with each other. Decision Problems.  ...  This is true even for one-dimensional cellular automata, but if the considered CA are reversible then the undecidability is known in the two-and higher dimensional cases only.  ... 
doi:10.1007/978-3-030-47361-7_1 fatcat:3qgnwqrqnvdltkqjbuzfgx7wty

What's Decidable About Parametric Timed Automata? [chapter]

Étienne André
2016 Communications in Computer and Information Science  
We provide here a survey of decision and computation problems for PTA.  ...  After two decades of research on PTA, it is now well-understood that any non-trivial problem studied is undecidable for general PTA.  ...  Acknowledgements This manuscript benefited from discussions with Didier Lime, Nicolas Markey, and Olivier H. Roux.  ... 
doi:10.1007/978-3-319-29510-7_3 fatcat:l6iugmbrjjfnja2oz767fbufaa

Quantum Conditional Strategies and Automata for Prisoners' Dilemmata under the EWL Scheme

Konstantinos Giannakis, Georgia Theocharopoulou, Christos Papalitsas, Sofia Fanarioti, Theodore Andronikos
2019 Applied Sciences  
Similarly, state machines, and specifically finite automata, have also been under constant and thorough study for plenty of reasons.  ...  This game variant can be considered as a specific type of game where the player's actions and strategies are formed using notions from quantum computation.  ...  Of course, there are also single-agent decision problems, and they are usually associated with Markovian dynamics.  ... 
doi:10.3390/app9132635 fatcat:rkqtrcjzlbeglibbenfrk43o5a

Subject index volumes 1–200

1999 Theoretical Computer Science  
finite automata, 507 grid precedence graph, 2755 iterative arrays. 1083 language. 1636 two-dimensional lattice, 3397 modulo tn. 3397 two-dimensional mesh, 2467 architecture, 2443 two-dimensional  ...  two-dimensional additive cellular automata, 3032 two-dimensional alternating finite automata, 2393, 2696 Turing machines, 537, 1256, 1269 two-dimensional categories, 6 12, 6 I5 cellular automaton  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

On Descriptional Complexity of the Planarity Problem for Gauss Words [article]

Vitaliy Kurlin, Alexei Lisitsa, Igor Potapov, Rafiq Saleh
2009 arXiv   pre-print
In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words.  ...  For establishing the upper bounds on recognition of knot properties, we study these problems in a context of automata models over an infinite alphabet.  ...  We have shown that the language of the signed Gauss words can be recognised by deterministic two-way register automata, while for the same problem for unsigned words we demonstrated an upper bound in terms  ... 
arXiv:0907.4180v1 fatcat:k6gjwrbiijdpnkawsez7uappcq

Plane-Walking Automata [chapter]

Ville Salo, Ilkka Törmä
2015 Lecture Notes in Computer Science  
We are unable to separate the second and third level of the hierarchy in one and two dimensions, and suggest a related open problem for two-counter machines.  ...  In this article, we study classes of multidimensional subshifts defined by multihead finite automata, in particular the hierarchy of classes of subshifts defined as the number of heads grows.  ...  We discuss why this problem appears hard to us, suggest a possible separating language, and state a related open problem for two-counter machines.  ... 
doi:10.1007/978-3-319-18812-6_11 fatcat:xtykzpvlpveuzpp7srkjhiehzu

Plane-Walking Automata [article]

Ville Salo, Ilkka Törmä
2014 arXiv   pre-print
We are unable to separate the second and third level of the hierarchy in one and two dimensions, and suggest a related open problem for two-counter machines.  ...  In this article, we study classes of multidimensional subshifts defined by multihead finite automata, in particular the hierarchy of classes of subshifts defined as the number of heads grows.  ...  We discuss why this problem appears hard to us, suggest a possible separating language, and state a related open problem for two-counter machines.  ... 
arXiv:1408.6701v1 fatcat:5il7fgviyfhyppyb2ygjfstcbe

Cumulative index of volumes 1–50

1988 Theoretical Computer Science  
TANIGUCHI, A relationship between two-dimensional finite automata and three-way tapebounded two-dimensional Turing machines (Note) INOUE, K., I. TAKANAMI and H.  ...  KACIMASA and N. TOKURA, Relations of flow languages to Petri net languages ARAKI, T. and T. KASAMI, Some decision problems related to the reachability problem for Petri nets ARAKI, T. and T.  ...  return and dual return complexities WEDDE, H., An interative and starvation-free solution for a general class of distributed control problems based on interaction primitives WEDDE, H., see A.  ... 
doi:10.1016/0304-3975(88)90002-3 fatcat:gasluptczbb6bfplioxrtdrlpy

Determining the equivalence for one-way quantum finite automata

Lvzhou Li, Daowen Qiu
2008 Theoretical Computer Science  
Then, as a quantum variant of FAs, quantum finite automata (QFAs) were developed and have received extensive attention from the academic community.  ...  (Note that quantum turing machines and quantum circuits, as two important models of quantum computation, were proved to be equivalent by Yao [36] , and the former are a base for quantum complexity theory  ...  Acknowledgements The authors are grateful to the referees and the editor for their invaluable comments and suggestions that greatly helped in improving the quality of this paper.  ... 
doi:10.1016/j.tcs.2008.03.021 fatcat:fzrlbvjhjvdq3l7ufdzix4gfgm
« Previous Showing results 1 — 15 out of 1,896 results