scientific article; zbMATH DE number 3639154
From MaRDI portal
Publication:4198067
zbMath0411.68049MaRDI QIDQ4198067
N. Z. Gabbasov, T. A. Murtazina
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
deterministic finite automatonprobabilistic finite automatonacceptation of languagesisolated cut- point
Related Items (2)
Complexity of probabilistic versus deterministic automata ⋮ Comparative complexity of the representation of languages by probabilistic automata
This page was built for publication:
