✦ LIBER ✦

Synthesis of spectral densities using finite automata

✍ Scribed by Monti, C.M.; Pierobon, G.L.; Viaro, U.

Book ID: 119789574
Publisher: IEEE
Year: 1993
Tongue: English
Weight: 411 KB
Volume: 41
Category: Article
ISSN: 1053-587X
DOI: 10.1109/78.215324

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Binary shape coding using finite automat

Binary shape coding using finite automata

✍ Makarov, A.; Moniri, M. 📂 Article 📅 2006 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 358 KB

Synthesis of computer programs that impl

Synthesis of computer programs that implement finite automata

✍ D. I. Cheremisinov 📂 Article 📅 2007 🏛 Allerton Press Inc 🌐 English ⚖ 169 KB

Decomposition method of structural synth

Decomposition method of structural synthesis of finite automata. II

✍ A. N. Melikhov; L. S. Bershtein; N. G. Topol'skii 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 616 KB

Decomposition method for structural synt

Decomposition method for structural synthesis of finite automata. I

✍ A. N. Melikhov; L. S. Bershtein; N. G. Topol'skii 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 505 KB

Formal synthesis of automata using multi

Formal synthesis of automata using multistable elements

✍ Yu. V. Kapitonova; A. T. Mishchenko; V. V. Yaremenko 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 353 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