A Modified Completeness Theorem of KAT and Decidability of Term Reducibility
From MaRDI portal
Publication:5410479
DOI10.1007/978-3-319-06251-8_6zbMath1344.68151OpenAlexW2198352470MaRDI QIDQ5410479
Publication date: 16 April 2014
Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/188452
Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25)
Related Items (1)
This page was built for publication: A Modified Completeness Theorem of KAT and Decidability of Term Reducibility
