scientific article; zbMATH DE number 1747446

MaRDI QIDQ4531377zbMATH OpenFDO

Authors Massimiliano Milani, Giovanni Fighizzini

Publication date 2001

zbMATH Keywords

descriptional complexitystate complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Finite automata and unary languages
• Mathematical Foundations of Computer Science 2003
• Optimal simulations between unary automata
• On the size of unary probabilistic and nondeterministic automata
• The complexity of probabilistic versus deterministic finite automata

Cited in

(6)

• Mathematical Foundations of Computer Science 2003
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
• One-way bounded-error probabilistic pushdown automata and Kolmogorov complexity (preliminary report)
• Optimal simulations between unary automata
• Normal forms for unary probabilistic automata
• scientific article; zbMATH DE number 3876601 (Why is no real title available?)

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