✦ LIBER ✦

Succinct representation of regular languages by boolean automata II

✍ Scribed by Ernst Leiss

Book ID: 107948549
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 322 KB
Volume: 38
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90215-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Succinct description of regular language

Succinct description of regular languages by weak restarting automata

✍ Martin Kutrib; Jens Reimann 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 175 KB

More concise representation of regular l

More concise representation of regular languages by automata and regular expressions

✍ Viliam Geffert; Carlo Mereghetti; Beatrice Palano 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 197 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

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

Representation of Automata by Groups. II

✍ V. G. Skobelev 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 129 KB