✦ LIBER ✦

Closure of finite-state automaton languages

✍ Scribed by Su Lan; Zhiwen Mo

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 193 KB
Volume: 75
Category: Article
ISSN: 0165-0114
DOI: 10.1016/0165-0114(94)00388-n

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite-state ω-languages

✍ Ludwig Staiger 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Closures which preserve finiteness in fa

Closures which preserve finiteness in families of languages

✍ Gene F. Rose 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 808 KB

Each set of operations selected from union, intersection, complement, star, quotients, derivatives, word-reversal, and homomorphisms is investigated with respect to its closure of an arbitrary family of word-sets, as well as to its closure of an arbitrary family of regular languages. Certain sets ar

Check words for the states of a finite a

Check words for the states of a finite automaton

✍ S. M. Gobershtein 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 355 KB

On coding the internal states of a finit

On coding the internal states of a finite automaton

✍ A. Akhmetkaziev 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 140 KB

Inference of finite-state transducers fr

Inference of finite-state transducers from regular languages

✍ Francisco Casacuberta; Enrique Vidal; David Picó 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Closure properties of slender languages

✍ Gheorghe Paŭn; Arto Salomaa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 576 KB