Decision procedures for inductive Boolean functions based on alternating automata

DOI10.1016/S0304-3975(02)00089-0zbMath1028.68079OpenAlexW2046451459MaRDI QIDQ1399969

Abdelwaheb Ayari, Felix Klaedtke, David A. 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)

Uses Software

• MONA

Cites Work

• On equations for regular languages, finite automata, and sequential networks
• Completeness results concerning systolic tree automata and E0L languages
• Alternating tree automata
• A note on the space complexity of some decision problems for finite automata
• Alternation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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