A note on closure properties of the classes of sets accepted by tape-bounded two-dimensional turing machines-Reference-Cited by-同舟云学术

A note on closure properties of the classes of sets accepted by tape-bounded two-dimensional turing machines

Published:1978-07 Issue:2 Volume:15 Page:143-158
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Inoue Katsushi,Takanami Itsuo

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference19 articles.

1. Automata on a 2-dimensional tape;Blum,1967

2. Two-characterizations of the context sensitive languages;Fisher,1969

3. On 2-dimensional pattern generating grammars;Yodogawa;IECE of Japan Trans. (C),1970

4. Some decision problems for two-dimensional nonwriting automata;Taniguchi;IECE of Japan Trans. (C),1971

5. Array automata and array grammars;Milgram,1971

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-closure property of space-bounded two-dimensional alternating Turing machines;Information Sciences;2002-10

2. CLOSURE PROPERTY OF SPACE-BOUNDED TWO-DIMENSIONAL ALTERNATING TURING MACHINES, PUSHDOWN AUTOMATA, AND COUNTER AUTOMATA;International Journal of Pattern Recognition and Artificial Intelligence;2001-11

3. Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic turing machines;Information Sciences;1999-04

4. Nonclosure Properties of Two-Dimensional One-Marker Automata;International Journal of Pattern Recognition and Artificial Intelligence;1997-11

5. A survey of two-dimensional automata theory;Information Sciences;1991-06