2012•Unpublished venueRequires access

Comparison of Two-Way Two-Dimensional Finite Automata and Three-Way Two-Dimensional Finite Automata

Jing Dong, Wenbing Jin

Abstract

Three types of two-way two-dimensional finite automata and three-way two-dimensional finite automata are studied, including deterministic, nondeterministic and Las Vegas finite automata. By comparing the languages recognized by above automata, two results are obtained: (1) The power of two-way two-dimensional nondeterministic finite automata and three-way two-dimensional deterministic finite automata cannot be compared, (2) The power of two-way two-dimensional nondeterministic finite automata and three-way two-dimensional Las Vegas finite automata cannot be compared.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Nondeterministic finite automaton, Quantum finite automata, Deterministic finite automaton, ω-automaton, DFA minimization, Nondeterministic algorithm, Automata theory, Las vegas