scientific article; zbMATH DE number 6819785

MaRDI QIDQ4599177zbMATH OpenFDO

Authors Martin Berglund, Henrik Björklund, Frank Drewes

Publication date 18 December 2017

Full work available at URL https://aclweb.org/anthology/W/W13/W13-3003.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 4074465
• Complexity analysis of term-rewriting systems
• On context-free rewriting with a simple restriction and its computational completeness
• scientific article; zbMATH DE number 2068882
• The derivational complexity of string rewriting systems
• Regularity and context-freeness over word rewriting systems
• scientific article; zbMATH DE number 4092759
• On the complexity of linearizability
• scientific article; zbMATH DE number 1962804
• Complexity analysis for term rewriting by integer transition systems

Cited in

(5)

• Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey
• Inferring local transition functions of discrete dynamical systems from observations of system behavior
• Complexity of uniform membership of context-free tree grammars
• On context-free rewriting with a simple restriction and its computational completeness
• scientific article; zbMATH DE number 1499087 (Why is no real title available?)

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