scientific article; zbMATH DE number 2201370

MaRDI QIDQ5313799zbMATH OpenFDO

Authors Frank Nießner

Publication date 1 September 2005

zbMATH Keywords

ambiguityregular \(\omega\)-language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the relation between ambiguity and nondeterminism in finite automata
• On the degree of ambiguity of finite automata
• On finitely ambiguous Büchi automata
• Ambiguity, nondeterminism and state complexity of finite automata
• A power-set construction for reducing Büchi automata to non-determinism degree two

Cited in

(3)

• Unambiguous Büchi automata.
• scientific article; zbMATH DE number 5279417 (Why is no real title available?)
• A power-set construction for reducing Büchi automata to non-determinism degree two

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