scientific article; zbMATH DE number 1796949

MaRDI QIDQ4551340zbMATH OpenFDO

Authors Nicholas Q. Tran

Publication date 5 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080021

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45)

Recommendations

• ON UNIVERSALLY POLYNOMIAL CONTEXT-FREE LANGUAGES
• scientific article; zbMATH DE number 2186402
• scientific article; zbMATH DE number 1834688
• A Polynomial Algorithm for the Inference of Context Free Languages
• A predicative and decidable characterization of the polynomial classes of languages
• scientific article; zbMATH DE number 7453188
• Polynomial identification in the limit of substitutable context-free languages
• scientific article; zbMATH DE number 1072537
• scientific article; zbMATH DE number 1114045
• Polynomial inference of universal automata from membership and equivalence queries

Cited in

(6)

• On universally easy classes for NP-complete problems.
• On universally easy classes for NP-complete problems
• ON UNIVERSALLY POLYNOMIAL CONTEXT-FREE LANGUAGES
• Polynomial languages with finite antidictionaries
• scientific article; zbMATH DE number 7453188 (Why is no real title available?)
• Polynomial inference of universal automata from membership and equivalence queries

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