scientific article; zbMATH DE number 3963203

MaRDI QIDQ3731034zbMATH OpenFDO

Authors Detlef Wotschke, Chandra M. R. Kintala

Publication date 1986

zbMATH Keywords

concurrent concisenessdegree automatanondeterministic automataprobabilistic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Concise representations of regular languages by degree and probabilistic finite automata
• The parallel complexity of finite-state automata problems
• The complexity of probabilistic versus deterministic finite automata
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• On the degree of ambiguity of finite automata

Cited in

(1)

• Concise representations of regular languages by degree and probabilistic finite automata

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 Q3731034)