scientific article; zbMATH DE number 4001489

MaRDI QIDQ4727435zbMATH OpenFDO

Authors F. Ablayev

Publication date 1985

zbMATH Keywords

isolated cutpointnonisolated cutpointnull cutpointprobabilistic Turing machinesrepesentability of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Probabilistic automata and processors (Significance, some methodologies and results)
• Stochasticity of the languages acceptable by two-way finite probabilistic automata
• scientific article; zbMATH DE number 3856433
• scientific article; zbMATH DE number 3222931
• scientific article; zbMATH DE number 3894479

Cited in

(4)

• A probabilistic model of computing with words
• Probabilistic automata and processors (Significance, some methodologies and results)
• scientific article; zbMATH DE number 3982547 (Why is no real title available?)
• Probabilistic Turing machines and recursively enumerable Dedekind cuts

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4727435)