✦ LIBER ✦

Fast language acceptance by shrinking cellular automata

✍ Scribed by Azriel Rosenfeld; Angela Y. Wu; Tsvi Dubitzki

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 498 KB
Volume: 30
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(83)90045-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel language recognition in constan

Parallel language recognition in constant time by cellular automata

✍ R. Sommerhalder; S. C. Westrhenen 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

A kleene-like characterization of langua

A kleene-like characterization of languages accepted by systolic tree automata

✍ E. Fachini; A. Monti 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 686 KB

We present a Kleen-like characterization of the class of languages accepted by systolic binary tree automata, L(SBTA). This characterization uses union, intersection, restricted concatenation, restricted concatenation closure, and finite substitution closure. The restrictions we impose on the operat

A simple linearization of the self-shrin

A simple linearization of the self-shrinking generator by means of cellular automata

✍ Amparo Fúster-Sabater; M. Eugenia Pazo-Robles; Pino Caballero-Gil 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 680 KB

Language not recognizable in real time b

Language not recognizable in real time by one-way cellular automata

✍ Véronique Terrier 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 454 KB

ω-Languages accepted by finite automata

ω-Languages accepted by finite automata whose structures are cascade products of resets

✍ Tetsuo Moriya 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 488 KB