✦ LIBER ✦

Multi-stack-counter languages

✍ Scribed by Ronald Book; Seymour Ginsburg

Book ID: 105283294
Publisher: Springer
Year: 1972
Tongue: English
Weight: 815 KB
Volume: 6
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01706072

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rudimentary relations and stack language

Rudimentary relations and stack languages

✍ Ytha Y. Yu 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 421 KB

One-way weak-stack-counter automata

✍ Satoru Miyano 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 994 KB

Type inference in stack based languages

✍ Bill Stoddart; Peter J. Knaggs 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 433 KB

Checking automata and one-way stack lang

Checking automata and one-way stack languages

✍ Sheila Greibach 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 837 KB

A checking automaton is equivalent to a one-way nonerasing stack automaton which, once it enters its stack, never again writes on its stack. The checking automaton languages (cal) form a full AFL closed under substitution. If L C a\* is an infinite cal, then L contains an infinite regular set. Conse

Multi-pattern languages

✍ Lila Kari; Alexandru Mateescu; Gheorghe Pǎun; Arto Salomaa 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

Inference of deterministic one-counter l

Inference of deterministic one-counter languages

✍ Josef Peter Heger; Juergen Heinz; Willi Kunz; Peter Ochsenschlaeger; Juergen Wat 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 1024 KB