Deciding monadic theories of hyperalgebraic trees

DOI10.1007/3-540-45413-6_21MaRDI QIDQ2778825zbMATH OpenFDO

Authors Paweł Urzyczyn, Teodor Knapik, Damian Niwiński

Publication date 21 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2044/20440253

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 2087432
• Typed Lambda Calculi and Applications
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 2102748
• On infinite transition graphs having a decidable monadic theory

Cited in

(14)

• The evaluation of first-order substitution is monadic second-order compatible
• scientific article; zbMATH DE number 3911742 (Why is no real title available?)
• On infinite terms having a decidable monadic theory
• scientific article; zbMATH DE number 2087432 (Why is no real title available?)
• scientific article; zbMATH DE number 2087543 (Why is no real title available?)
• Homogeneity without loss of generality
• Streett Automata Model Checking of Higher-Order Recursion Schemes
• On the termination problem for probabilistic higher-order recursive programs
• scientific article; zbMATH DE number 223548 (Why is no real title available?)
• Monodic Tree Kleene Algebra
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Typed Lambda Calculi and Applications
• Cost Automata, Safe Schemes, and Downward Closures
• Cost automata, safe schemes, and downward closures

This page was built for publication: Deciding monadic theories of hyperalgebraic trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778825)