✦ LIBER ✦

On the statistical properties of transformations realizabie on finite automata

✍ Scribed by V. M. Sidel'nikov

Publisher: Springer US
Year: 1965
Tongue: English
Weight: 946 KB
Volume: 1
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01074690

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A group of one-to-one transformations de

A group of one-to-one transformations defined by finite automata

✍ F. Geceg 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 190 KB

On the finite degree of ambiguity of fin

On the finite degree of ambiguity of finite tree automata

✍ Helmut Seidl 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 756 KB

On the imbedding of asynchronous automat

On the imbedding of asynchronous automata into a product of finite automata

✍ É. A. Vartapetov 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 164 KB

On the Computational Complexity of Finit

On the Computational Complexity of Finite Cellular Automata

✍ K. Sutner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N

On the Learnability and Usage of Acyclic

On the Learnability and Usage of Acyclic Probabilistic Finite Automata

✍ Dana Ron; Yoram Singer; Naftali Tishby 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 960 KB

We propose and analyze a distribution learning algorithm for a subclass of acyclic probalistic finite automata (APFA). This subclass is characterized by a certain distinguishability property of the automata's states. Though hardness results are known for learning distributions generated by general A

Optimal estimation on the order of local

Optimal estimation on the order of local testability of finite automata

✍ A.N. Trahtman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 141 KB

A locally testable language L is a language with the property that for some nonnegative integer k, called the order of local testability, whether or not a word u is in the language L depends on (1) the preÿx and su x of the word u of length k -1 and (2) the set of subwords of length k of the word u.