✦ LIBER ✦

Succinct description of regular languages by weak restarting automata

✍ Scribed by Martin Kutrib; Jens Reimann

Book ID: 113641760
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 175 KB
Volume: 206
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2008.03.016

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 representation of regular langu

Succinct representation of regular languages by boolean automata II

✍ Ernst Leiss 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 322 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

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