✦ LIBER ✦

Finite automata and unary languages

✍ Scribed by Marek Chrobak

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 597 KB
Volume: 47
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90142-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Errata to: “Finite Automata and Unary La

Errata to: “Finite Automata and Unary Languages”: [Theoret. Comput. Sci. 47 (1986) 149–158]

✍ Marek Chrobak 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 146 KB

In [1], I presented several results on the state complexity of di erent types of ÿnite automata for unary languages. The following function F : N → N plays a crucial role in that paper:

Alternating finite automata and star-fre

Alternating finite automata and star-free languages

✍ Kai Salomaa; Sheng Yu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 96 KB

For a given extended regular expression e we construct an equational representation of an alternating ÿnite automaton accepting the language denoted by e. For star-free extended regular expressions the construction yields a loop-free alternating ÿnite automaton. Also the inclusion in the opposite di

Finite fuzzy automata, regular fuzzy lan

Finite fuzzy automata, regular fuzzy languages, and pattern recognition

✍ M.G. Thomason 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 387 KB

On the Languages Representable by Finite

On the Languages Representable by Finite Probabilistic Automata

✍ Phan Dinh Diêu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 837 KB

On stochastic automata and languages

✍ K.S. Fu; T.J. Li 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 962 KB

Efficient implementation of regular lang

Efficient implementation of regular languages using reversed alternating finite automata

✍ K. Salomaa; X. Wu; S. Yu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Alternating ÿnite automata (AFA) provide a natural and succinct way to denote regular languages. We introduce a bit-wise representation of reversed AFA (r-AFA) transition functions and describe an e cient implementation method for r-AFA and their operations using this representation. Experiments hav