On the Complexity of RSRL

DOI10.1016/S1571-0661(05)82580-0zbMath1263.03026MaRDI QIDQ4923561

Stephan Kepser

Publication date: 24 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic of natural languages (03B65) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Natural language processing (68T50) Linguistics (91F20)

Related Items (1)

Polyadic dynamic logics for HPSG parsing

Cites Work

• The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar
• A note on the Entscheidungsproblem
• A variant of a recursively unsolvable problem
• Unnamed Item

This page was built for publication: On the Complexity of RSRL