✦ LIBER ✦

Representations of Regular Ideals in Finite Automata

✍ Scribed by I. K. Rystsov

Book ID: 111575987
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 51 KB
Volume: 39
Category: Article
ISSN: 1573-8337
DOI: 10.1023/b:casa.0000012087.71746.0e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Representations of finite automata

✍ I. S. Grunskii 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 778 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

Bideterministic automata and minimal rep

Bideterministic automata and minimal representations of regular languages

✍ Hellis Tamm; Esko Ukkonen 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Representation of 2-events in finite aut

Representation of 2-events in finite automata

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

Representability of nonregular languages

Representability of nonregular languages in finite probabilistic automata

✍ Robert Knast 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 779 KB

Succinct representation of regular langu

Succinct representation of regular languages by boolean automata

✍ Ernst Leiss 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Boolean automata are a generalization of finite automata in the sense that the 'next state'i i.e. the result of the transition function given a state and a letter, is not just a single state (deterministic automata) or a union of states (nondeterministic automata) but a boolean function of states. B