On the time and tape complexity of weak unification

DOI10.1016/0020-0190(81)90114-9zbMath0469.68056OpenAlexW2074302007MaRDI QIDQ1157173

R. Lapsien, W. Erni

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90114-9

zbMATH Keywords

analysis of algorithmstheory of computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (1)

On the time and tape complexity of weak unification

Cites Work

• On the time and tape complexity of weak unification
• Linear unification
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• The Concept of Weak Substitution in Theorem-Proving
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Language recognition by marking automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the time and tape complexity of weak unification