scientific article; zbMATH DE number 1747446

zbMATH Open1050.68095MaRDI QIDQ4531377FDOQ4531377

Authors: Massimiliano Milani, Giovanni Fighizzini 

Publication date: 2001

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

descriptional complexitystate complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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
• Title not available (Why is that?)

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)