𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Languages Representable by Finite Probabilistic Automata

✍ Scribed by Phan Dinh Diêu

Publisher
John Wiley and Sons
Year
1971
Tongue
English
Weight
837 KB
Volume
17
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Finite Languages for the Representation
Finite Languages for the Representation of Finite Graphs
✍ Andrzej Ehrenfeucht; Joost Engelfriet; Grzegorz Rozenberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 538 KB

We introduce a new way of specifying graphs: through languages, i.e., sets of strings. The strings of a given (finite, prefix-free) language represent the vertices of the graph; whether or not there is an edge between the vertices represented by two strings is determined by the pair of symbols at th

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