✦ LIBER ✦

Representations of finite automata

✍ Scribed by I. S. Grunskii

Publisher: Springer US
Year: 1985
Tongue: English
Weight: 778 KB
Volume: 21
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01072098

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Representation of 2-events in finite aut

Representation of 2-events in finite automata

✍ B. G. Mirkin 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 220 KB

Image Representation using Distributed W

Image Representation using Distributed Weighted Finite Automata

✍ Y. Sivasubramanyam; Kamala Krithivasan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Weighted finite automata (WFA) define real functions, in particular, grayness functions of graytone images. Inference algorithm that converts an arbitrary function (graytone image) into a WFA that can regenerate it is given in [7]. In this paper we define the theoretical construct of Cooperating Dis

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

Concise representations of regular langu

Concise representations of regular languages by degree and probabilistic finite automata

✍ Chandra M. R. Kintala; Kong -Yee Pun; Detlef Wotschke 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 744 KB

Arithmetic representations of cellular a

Arithmetic representations of cellular automata

✍ Jesús Urías 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 849 KB

Criteria for the representation of event

Criteria for the representation of events in finite probabilistic automata. I

✍ R. G. Bukharaev 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 759 KB