Name
Abstract | ||
|---|---|---|
Several nonclosure properties of each class of sets accepted by two-dimensional alternating one-marker automata, alternating one-marker automata with only universal states, nondeterministic one-marker automata, deterministic one-marker automata, alternating finite automata, and alternating finite automata with only universal states are shown. To do this, we first establish the upper bounds of the working space used by ''three-way'' alternating Turing machines with only universal states to simulate those ''four-way'' non-storage machines. These bounds provide us a simplified and unified proof method for the whole variants of one-marker and/or alternating finite state machine, without directly analyzing the complex behavior of the individual four-way machine on two-dimensional rectangular input tapes. We also summarize the known closure properties including Boolean closures for all the variants of two-dimensional alternating one-marker automata. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1142/S0218001497000469 | INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE |
Keywords | Field | DocType |
automaton, two-dimensional tape, connected picture, one-marker, closure property, alternation, Turing machine | Quantum finite automata,Discrete mathematics,Automata theory,Continuous spatial automaton,Mobile automaton,Nested word,Computer science,Finite-state machine,ω-automaton,Theory of computation | Journal |
Volume | Issue | ISSN |
11 | 7 | 0218-0014 |
Citations | PageRank | References |
3 | 0.45 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akira Ito | 1 | 3 | 0.45 |
| Katsushi Inoue | 2 | 515 | 74.43 |
| Yue Wang | 3 | 34 | 9.08 |