✦ LIBER ✦

On the Succinctness of Different Representations of Languages

✍ Scribed by Hartmanis, J.

Book ID: 118174053
Publisher: Society for Industrial and Applied Mathematics
Year: 1980
Tongue: English
Weight: 866 KB
Volume: 9
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0209010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the recursion-theoretic complexity of

On the recursion-theoretic complexity of relative succinctness of representations of languages

✍ Louise Hay 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 287 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

On the succinct representation of graphs

✍ György Turán 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 371 KB

On Gödel speed-up and succinctness of la

On Gödel speed-up and succinctness of language representations

✍ J. Hartmanis 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 798 KB

Succinct representation of regular langu

Succinct representation of regular languages by boolean automata II

✍ Ernst Leiss 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 322 KB

A note on the succinctness of descriptio

A note on the succinctness of descriptions of deterministic languages

✍ Leslie G. Valiant 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 301 KB