scientific article; zbMATH DE number 1302628
From MaRDI portal
Publication:4249176
zbMath0928.03002MaRDI QIDQ4249176
Harald Ganzinger, Margus Veanes, Florent Jacquemard
Publication date: 12 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilitysecond-order unificationEXPTIME-completeautomata-theoretic methodsrigid \(E\)-unificationdecidable subclassesrigid reachability
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)
Related Items (5)
Tractable and intractable second-order matching problems ⋮ Reachability and confluence are undecidable for flat term rewriting systems ⋮ Logic with equality: Partisan corroboration and shifted pairing ⋮ On the undecidability of second-order unification ⋮ Farmer's theorem revisited
This page was built for publication: