✦ LIBER ✦

Inference of deterministic one-counter languages

✍ Scribed by Josef Peter Heger; Juergen Heinz; Willi Kunz; Peter Ochsenschlaeger; Juergen Watzke; Helmut Weber

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 1024 KB
Volume: 32
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(84)90048-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Commutative One-counter languages are re

Commutative One-counter languages are regular

✍ M. Latteux; G. Rozenberg 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Deterministic Algorithms, Simple Languag

Deterministic Algorithms, Simple Languages And One-to-One Gentzen Type Formalizations

✍ Anita Wasilewska 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 452 KB

A hierarchy of deterministic languages

✍ Michael A. Harrison; Amiram Yehudai 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 957 KB

One-way globally deterministic synchroni

One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages

✍ Anna Slobodová 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Output String Languages of Compositions

Output String Languages of Compositions of Deterministic Macro Tree Transducers

✍ Joost Engelfriet; Sebastian Maneth 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 376 KB

The composition of total deterministic macro tree transducers gives rise to a proper hierarchy with respect to their output string languages (these are the languages obtained by taking the yields of the output trees). There is a language not in this hierarchy which can be generated by a (quite restr

A hierarchy of real-time deterministic l

A hierarchy of real-time deterministic languages and their equivalence

✍ Amiram Yehudai 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 504 KB