✦ LIBER ✦

Robust RBF finite automata

✍ Scribed by Michal Šorel; Jiřı́ Šı́ma

Book ID: 113813648
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 310 KB
Volume: 62
Category: Article
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2003.12.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite counting automata

✍ M.P. Schützenberger 📂 Article 📅 1962 🏛 Elsevier Science ⚖ 769 KB

Separating Exponentially Ambiguous Finit

Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata

✍ Leung, Hing 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 267 KB

Robustization of a learning method for R

Robustization of a learning method for RBF networks

✍ V.David Sánchez A 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 614 KB

Finite abstract random automata

✍ Octav Onicescu; Silviu GuiaŞu 📂 Article 📅 1965 🏛 Springer 🌐 English ⚖ 337 KB

Enumeration of finite automata

✍ Frank Harary; Ed Palmer 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 432 KB

Finite-turn checking automata

✍ Rani Siromoney 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 443 KB

A one-to-one correspondence is established between the class of all equal matrix languages and the class of finite-turn checking automata. This checking automaton is provided with a counter in its memory to keep track of the number of turns of the stack-head. Several closure properties of this famil