scientific article; zbMATH DE number 1502106

MaRDI QIDQ4503147zbMATH OpenFDO

Authors Hing-Man Leung

Publication date 4 September 2000

zbMATH Keywords

nondeterministic finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cited in

(10)

• scientific article; zbMATH DE number 1949664 (Why is no real title available?)
• Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata
• scientific article; zbMATH DE number 4187120 (Why is no real title available?)
• On input-revolving deterministic and nondeterministic finite automata
• Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata
• scientific article; zbMATH DE number 5309908 (Why is no real title available?)
• 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

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)