๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On path equivalence of nondeterministic finite automata

โœ Scribed by Tzeng Wen-Guey

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
384 KB
Volume
58
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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