Decision procedures for inductive Boolean functions based on alternating automata

DOI10.1016/S0304-3975(02)00089-0MaRDI QIDQ1399969zbMATH OpenOpenAlexFDO

Authors Abdelwaheb Ayari, Felix Klaedtke, David Basin

Publication date 30 July 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(02)00089-0

zbMATH Keywords

verificationcircuitparameterizedAlternating automatoninductive Boolean function

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1670776
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 2090285
• Binary decision diagrams
• On the descriptive and algorithmic power of parity ordered binary decision diagrams

Cites work

• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3510287 (Why is no real title available?)
• scientific article; zbMATH DE number 1223628 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• A note on the space complexity of some decision problems for finite automata
• Alternating tree automata
• Alternation
• Completeness results concerning systolic tree automata and E0L languages
• On equations for regular languages, finite automata, and sequential networks

Cited in

(1)

• scientific article; zbMATH DE number 1670776 (Why is no real title available?)

Describes a project that uses

Uses Software

• MONA

This page was built for publication: Decision procedures for inductive Boolean functions based on alternating automata

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