𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of finite autonomous Moore automata

✍ Scribed by M. Katsura

Publisher
Springer Netherlands
Year
1987
Tongue
English
Weight
825 KB
Volume
18
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Computational Complexity of Finit
On the Computational Complexity of Finite Cellular Automata
✍ K. Sutner πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N

On tape-bounded complexity classes and m
On tape-bounded complexity classes and multihead finite automata
✍ I.H. Sudborough πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 798 KB

The principal result described in this paper is the equivalence of the following statements : (1) Every set accepted by a nondeterministic one-way two-head finite automaton can be accepted by a deterministic two-way k-head finite automaton, for some k. (2) The context-free language Lp (described i

On the complexity of intersecting finite
On the complexity of intersecting finite state automata and NL versus NP
✍ George Karakostas; Richard J. Lipton; Anastasios Viglas πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 256 KB

We consider uniform and non-uniform assumptions for the hardness of an explicit problem from ΓΏnite state automata theory. First we show that a small improvement in the known straightforward algorithm for this problem can be used to design faster algorithms for subset sum and factoring, and improved

Operation-preserving functions and auton
Operation-preserving functions and autonomous factors of finite automata
✍ Jerzy W. Grzymala-Busse πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 549 KB

The relationship between the structure of autonomous finite automata and their operation-preserving functions is considered. The results imply some ideas in the study of operation-preserving functions of arbitrary finite automata, because with each finite automaton the set of its autonomous factors

A note on the space complexity of some d
A note on the space complexity of some decision problems for finite automata
✍ Tao Jiang; B. Ravikumar πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 533 KB

In this note, we establish the space complexity of decision problems (such as membership, nonemptiness and equivalence) for some finite automata. Our study includes 2-way infinite automata with a pebble.