𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decision problems forω-automata

✍ Scribed by L. H. Landweber

Publisher
Springer
Year
1969
Tongue
English
Weight
629 KB
Volume
3
Category
Article
ISSN
1433-0490

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

On alternating ω-automata
On alternating ω-automata
✍ Peter A. Lindsay 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 456 KB
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.

Finite automata on timed ω-trees
Finite automata on timed ω-trees
✍ Salvatore La Torre; Margherita Napoli 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 264 KB

In the last decade Alur and Dill introduced a model of automata on timed !-sequences which extends the traditional models of ÿnite automata. In this paper, we present a theory of timed !-trees which extends both the theory of timed !-sequences and the theory of !-trees. The main motivation is to int

Decision Problems for Patterns
Decision Problems for Patterns
✍ T. Jiang; A. Salomaa; K. Salomaa; S. Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 742 KB

We settle an open problem, the inclusion problem for pattern languages. This is the first known case where inclusion is undecidable for generative devices having a trivially decidable equivalence problem. The study of patterns goes back to the seminal work of Thue and is important also, for instance