✦ LIBER ✦

More concise representation of regular languages by automata and regular expressions

✍ Scribed by Viliam Geffert; Carlo Mereghetti; Beatrice Palano

Book ID: 113641903
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 197 KB
Volume: 208
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.01.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Bideterministic automata and minimal rep

Bideterministic automata and minimal representations of regular languages

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

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

The representation of automatonic mappin

The representation of automatonic mappings by regular expressions

✍ M. A. Spivak 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 179 KB