Behavioral Strengths and Weaknesses of Various Models of Limited Automata

11/09/2021
by   Tomoyuki Yamakami, et al.
0

We examine the behaviors of various models of k-limited automata, which naturally extend Hibbard's [Inf. Control, vol. 11, pp. 196–238, 1967] scan limited automata, each of which is a single-tape linear-bounded automaton satisfying the k-limitedness requirement that the content of each tape cell should be modified only during the first k visits of a tape head. One central computation model is a probabilistic k-limited automaton (abbreviated as a k-lpa), which accepts an input exactly when its accepting states are reachable from its initial state with probability more than 1/2 within expected polynomial time. We also study the behaviors of one-sided-error and bounded-error variants of such k-lpa's as well as the deterministic, nondeterministic, and unambiguous models of k-limited automata, which can be viewed as natural restrictions of k-lpa's. We discuss fundamental properties of these machine models and obtain inclusions and separations among language families induced by them. In due course, we study special features – the blank skipping property and the closure under reversal – which are keys to the robustness of k-lpa's.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/18/2019

One-Way Topological Automata and the Tantalizing Effects of Their Topological Features

We cast new light on the existing models of 1-way deterministic topologi...
research
07/05/2019

Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice

The state complexity of a finite(-state) automaton intuitively measures ...
research
03/18/2022

Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata

The closure of deterministic context-free languages under logarithmic-sp...
research
03/28/2022

Sublinear-Time Probabilistic Cellular Automata

We propose and investigate a probabilistic model of sublinear-time one-d...
research
11/04/2021

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata

In various models of one-way pushdown automata, the explicit use of two ...
research
03/22/2020

The Power of a Single Qubit: Two-way Quantum Finite Automata and the Word Problem

The two-way finite automaton with quantum and classical states (2QCFA), ...
research
10/29/2018

The problem with probabilistic DAG automata for semantic graphs

Semantic representations in the form of directed acyclic graphs (DAGs) h...

Please sign up or login with your details

Forgot password? Click here to reset