✦ LIBER ✦

Fast reversible language recognition using cellular automata

✍ Scribed by Martin Kutrib; Andreas Malcher

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast parallel language recognition by ce

Fast parallel language recognition by cellular automata

✍ Oscar H. Ibarra; Michael A. Palis; Sam M. Kim 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 811 KB

Fast language acceptance by shrinking ce

Fast language acceptance by shrinking cellular automata

✍ Azriel Rosenfeld; Angela Y. Wu; Tsvi Dubitzki 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Faster recognition of languages for boun

Faster recognition of languages for bounded cellular automata

✍ Hiromi Miyajima 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 674 KB

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 real-time recognition of languages for

A real-time recognition of languages for bounded cellular automata

✍ Hiromi Miyajima 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 801 KB

Efficient implementation of regular lang

Efficient implementation of regular languages using reversed alternating finite automata

✍ K. Salomaa; X. Wu; S. Yu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Alternating ÿnite automata (AFA) provide a natural and succinct way to denote regular languages. We introduce a bit-wise representation of reversed AFA (r-AFA) transition functions and describe an e cient implementation method for r-AFA and their operations using this representation. Experiments hav