"Satisfiability of Word Equations with Constants is in NEXPTIME."

Wojciech Plandowski (1999)

Details and statistics

DOI: 10.1145/301250.301443

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

a service of  Schloss Dagstuhl - Leibniz Center for Informatics