𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decision Problems of Finite Automata Design and Related Arithmetics

✍ Scribed by Calvin C. Elgot

Book ID
125676441
Publisher
American Mathematical Society
Year
1961
Tongue
English
Weight
949 KB
Volume
98
Category
Article
ISSN
0002-9947

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Intractability of decision problems for
Intractability of decision problems for finite-memory automata
✍ Hiroshi Sakamoto; Daisuke Ikeda πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 145 KB

This paper deals with ΓΏnite-memory automata, introduced in Kaminski and Francez (Theoret. Comput. Sci. 134 (1994) 329-363). With a restricted memory structure that consists of a ΓΏnite number of registers, a ΓΏnite-memory automaton can store arbitrary input symbols. Thus, the language accepted by a ΓΏn

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.