𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The decision problem for some logics for finite words on infinite alphabets

✍ Scribed by Ch. Choffrut; S. Grigorieff


Publisher
Springer US
Year
2009
Tongue
English
Weight
255 KB
Volume
158
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A note on the space complexity of some d
✍ 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.