Approximate Satisfiability and Equivalence
DOI10.1137/070703776zbMath1207.68160MaRDI QIDQ3068633
Michel de Rougemont, Frédéric Magniez, Eldar Fischer
Publication date: 17 January 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070703776
context-free languages; PSPACE-complete; equivalence testing; edit distance with moves; infinite regular languages; \(\varepsilon\)-equivalence; monadic second-order formulas; \(\varepsilon\)-satisfiability
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
68Q42: Grammars and rewriting systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items