scientific article; zbMATH DE number 5788680

DOI10.25596/JALC-2009-187MaRDI QIDQ3589635zbMATH OpenFDO

Authors Taishin Yasunobu Nishida

Publication date 20 September 2010

Full work available at URL https://doi.org/10.25596/JALC-2009-187

zbMATH Keywords

derivation complexityDT0L systemsgenerative complexitylazy derivation

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• On a method for proving exact bounds on derivational complexity in Thue systems
• scientific article; zbMATH DE number 3954903
• scientific article; zbMATH DE number 8795
• The exact hardness of deciding derivational and runtime complexity
• scientific article; zbMATH DE number 2084848
• The derivational complexity of string rewriting systems
• Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
• Complexity of quantifier elimination in the theory of ordinary differential equations
• On the average complexity of partial derivative transducers
• Transforming derivational complexity of term rewriting to runtime complexity

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