4,247 Hits in 4.7 sec

Page 5461 of Mathematical Reviews Vol. , Issue 88j [page]

1988 Mathematical Reviews  
Summary: “We previously introduced a two-dimensional automa- ton with the following structure. The two-dimensional input tape is rotated clockwise by 90, 180 and 270 degrees.  ...  It scans the rotated input with a one-dimensional bounded cellular accep- tor, and the acceptance or rejection is determined by intersection or union.  ... 

Degrees of Restriction for Two-Dimensional Automata [article]

Taylor J. Smith, Kai Salomaa
2021 arXiv   pre-print
extended two-way two-dimensional automata.  ...  ., two-way) two-dimensional automaton has a read-only input head that moves in three (resp., two) directions on a finite array of cells labelled by symbols of the input alphabet.  ...  two-dimensional automata.  ... 
arXiv:2105.01179v1 fatcat:3vkug4xxifgxpaqqhchdko7abm

Page 416 of Mathematical Reviews Vol. , Issue 91A [page]

1991 Mathematical Reviews  
two-way two-dimensional alternating finite automata through | 80°-rotation.  ...  the two-dimensional input tape can only move right or down.  ... 

Two-dimensional cellular automata and deterministic on-line tessalation automata

Véronique Terrier
2003 Theoretical Computer Science  
We generalize the result known for one-dimensional cellular automata to two-dimensional cellular automata with Von Neumann neighborhood: the class of real time cellular automata is closed under rotation  ...  In this work we consider the relationships between the classes of two-dimensional languages deÿned by deterministic on-line tessellation automata and by real time two-dimensional cellular automata with  ...  Ito and Inoue [6] have shown that DOTA are equivalent to two-way two-dimensional alternating ÿnite automata through 180 • rotation.  ... 
doi:10.1016/s0304-3975(02)00575-3 fatcat:2qk2oct5fbfodhl6gnqp3tu2b4

Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata

Tao Jiang, Oscar H. Ibarra, Hui Wang
1994 Theoretical Computer Science  
Wang, Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata, Theoretical Computer Science 125 (1994) 243-257.  ...  Since then, some new types of automata with two-dimensional input tape have been introduced.  ...  Introduction Blum and Hewitt [l] were the first to study finite automata and marker automata operating on a two-dimensional input tape.  ... 
doi:10.1016/0304-3975(92)00010-o fatcat:p6vmdesso5anhlnwcnwyjcc7ea

Page 4457 of Mathematical Reviews Vol. , Issue 82j [page]

1982 Mathematical Reviews  
Inoue, Katsushi; Takanami, Itsuo; Taniguchi, Hiroshi Two-dimensional automata with rotated inputs. Inform. Sci. 21 (1980), no. 3, 221-240.  ...  Authors’ summary: “We introduce a new type of automata on a two- dimensional tape, which decides acceptance or rejection of an input tape x by scanning the tape x from various sides by various automata  ... 

Page 3789 of Mathematical Reviews Vol. , Issue 84i [page]

1984 Mathematical Reviews  
Peak (Budapest) Inoue, Katsushi (J-YAMAS-A); 84i:68094 Takanami, Itsuo(J-YAMAS-A); Taniguchi, Hiroshi(J-YAMAS-A) Two-dimensional automata with rotated inputs (projection-type). Inform.  ...  Authors’ summary: “We introduce a new type of automaton on a two-dimensional tape, which decides acceptance or rejection of an input tape x by first scanning the tape x from various sides with parallel  ... 

Page 3834 of Mathematical Reviews Vol. , Issue 87g [page]

1987 Mathematical Reviews  
Three-way two-dimensional finite automata with rotated inputs. Inform. Sct. 38 (1986), no. 3, 271-282.  ...  Summary: “This paper introduces a new type of two-dimensional automaton, called a three-way two-dimensional finite automaton with rotated inputs, and investigates a relationship among the accepting powers  ... 

Reversible Computation in Asynchronous Cellular Automata [chapter]

Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita, Shinro Mashiko
2002 Lecture Notes in Computer Science  
In this paper, we present the embedding of a universal reversible Turing machine (RTM) in a two-dimensional self-timed cellular automaton (STCA), a special type of asynchronous cellular automaton, of which  ...  Particularly suitable asynchronous models for the study of reversibility are asynchronous cellular automata.  ...  Self-Timed Cellular Automata A Self-Timed Cellular Automaton (STCA) [11] is a two-dimensional array of identical cells, each of which can be in one of 16 states.  ... 
doi:10.1007/3-540-45833-6_19 fatcat:5zon3kxw4fcxplzc5sgggnj2ky

Picture Recognizability with Automata Based on Wang Tiles [chapter]

Violetta Lonati, Matteo Pradella
2010 Lecture Notes in Computer Science  
We also consider a very natural notion of determinism for Wang automata, and study the resulting class, comparing it with other deterministic classes considered in the literature, like DREC and Snake-DREC  ...  the input head visits the picture moving from one pixel to an adjacent one, according to some scanning strategy.  ...  Which is the relation between Scan-DREC and the class of languages recognized by deterministic 4-way automata? We know that the latter class is incomparable to both Diag-DREC and Snake-DREC.  ... 
doi:10.1007/978-3-642-11266-9_48 fatcat:ksde6be3rjexrnqplpawvyq2ga

Designing and fabricating mechanical automata from mocap sequences

Duygu Ceylan, Wilmot Li, Niloy J. Mitra, Maneesh Agrawala, Mark Pauly
2013 ACM Transactions on Graphics  
Creating such automata requires expertise in motion planning, knowledge of mechanism design, and familiarity with fabrication constraints.  ...  Our approach has two stages.  ...  We thank Minh Dang for performing the kendo sequence and Zohreh Sasanian for helping with the assembly of the physical prototypes.  ... 
doi:10.1145/2508363.2508400 fatcat:io4zyocrb5e7lembnunwaq4i4q

Quantum advantage using high-dimensional twisted photons as quantum finite automata [article]

Stephen Z. D. Plachta, Markus Hiekkamäki, Abuzer Yakaryılmaz, Robert Fickler
2022 arXiv   pre-print
Using two to eight OAM quantum states to implement up to four parallel qubits, we show that a high-dimensional QFA is able to detect the prime numbers 5 and 11 while outperforming classical finite automata  ...  Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations.  ...  AY was partially supported by the ERDF project Nr. "Quantum computers with constant memory" and the project "Quantum algorithms: from complexity theory to experiment" funded under ERDF  ... 
arXiv:2202.04915v1 fatcat:r5msdxq7hnhgtc7zlwmc3p32ea

Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180°-rotation

Akira Ito, Katsushi Inoue, Itsuo Takanami
1989 Theoretical Computer Science  
A two-way two-dimensional alternating finite automaton (TW2-AFA) is a twodimensional alternating finite automaton whose input head can move right and down (or may not move), but cannot move left or up.  ...  In this paper, we show that 2-dota's are equivalent to TW2-AFA's through 1809rotation. ctio Recently [ 51, two-dimensional alternating finite automata (2-A 's) were introduced as a generalization of two-dimensional  ...  oD", for each i a 2, similarly. 1 . . . a mn3 180" rotation xR' of x is . For any two-dimensional ta x=411 . . . Qln . . . . . . . . a,Q mn l -* Qml . . . . . . . . .  ... 
doi:10.1016/0304-3975(89)90154-0 fatcat:incaotkpmjg4vpqa7wj5m7n5li

Watson-Crick Local Languages and Watson-Crick Two Dimensional Local Languages

Samuel Mary Jemima, Rajkumar Dare
2015 International Journal of Mathematics and Soft Computing  
Watson-Crick finite automata are language recognizing devices similar to finite automata introduced in DNA computing area.  ...  Local languages are of great interest in the study of formal languages using factors of length two or more.  ...  They are finite automata with two reading heads, working on double stranded sequences.  ... 
doi:10.26708/ijmsc.2015.2.5.19 fatcat:n6ktsl3rufdvpevayimemoy2cu

Closure properties of cellular automata

Véronique Terrier
2006 Theoretical Computer Science  
Moreover, in the case of two-dimensional CA recognizers, we investigate how restricted communication reduces the computational power.  ...  Concerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have proved that real time cellular automata (CA) and linear time CA are equivalent if and only if real time CA is  ...  A two-dimensional language over is a subset of * * . p 180 denotes the picture p rotated by 180 • . And L 180 is the set of all pictures of L rotated by 180 • .  ... 
doi:10.1016/j.tcs.2005.10.039 fatcat:45ddnvtzb5dillgobun33k2c4y
« Previous Showing results 1 — 15 out of 4,247 results