scientific article; zbMATH DE number 1502106

zbMATH Open0965.68039MaRDI QIDQ4503147FDOQ4503147

Authors: Hing-Man Leung 

Publication date: 4 September 2000

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

Recommendations

• A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
• scientific article; zbMATH DE number 1759430
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• scientific article; zbMATH DE number 1949664

zbMATH Keywords

nondeterministic finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (10)

• Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata
• Title not available (Why is that?)
• On input-revolving deterministic and nondeterministic finite automata
• Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata
• Title not available (Why is that?)
• On the Construction of a Family of Automata That Are Generically Non-minimal
• On the Size Complexity of Rotating and Sweeping Automata
• Succinct representation for (non)deterministic finite automata
• A characterisation of NL/poly via nondeterministic finite 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 Q4503147)