✦ LIBER ✦

Binary shape coding using finite automata

✍ Scribed by Makarov, A.; Moniri, M.

Book ID: 114457929
Publisher: The Institution of Electrical Engineers
Year: 2006
Tongue: English
Weight: 358 KB
Volume: 153
Category: Article
ISSN: 1350-245X
DOI: 10.1049/ip-vis:20050112

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterizing Experiments for Finite-Me

Characterizing Experiments for Finite-Memory Binary Automata

✍ Gill, Arthur 📂 Article 📅 1960 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 462 KB

Economical coding of the states of finit

Economical coding of the states of finite automata

✍ L. K. Lakin; L. M. Osinskii 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 456 KB

On viewing block codes as finite automat

On viewing block codes as finite automata

✍ Priti Shankar; Amitava Dasgupta; Kaustubh Deshmukh; B.Sundar Rajan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 320 KB

Block codes are viewed from a formal language theoretic perspective. It is shown that properties of trellises for subclasses of block codes called rectangular codes follow naturally from the Myhill Nerode theorem. A technique termed subtrellis overlaying is introduced with the object of reducing dec

Checking Finite Traces Using Alternating

Checking Finite Traces Using Alternating Automata

✍ Bernd Finkbeiner; Henny Sipma 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 196 KB

Checking Finite Traces using Alternating

Checking Finite Traces using Alternating Automata

✍ Bernd Finkbeiner; Henny Sipma 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 298 KB

Coded modulation using superimposed bina

Coded modulation using superimposed binary codes

✍ Xiao Ma; Li Ping 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 487 KB