Testing language containment for \(\omega\)-automata using BDDs

DOI10.1006/inco.1995.1055zbMath0826.68050OpenAlexW2030624121MaRDI QIDQ1891138

Robert K. Brayton, Hervé J. Touati, Robert Kurshan

Publication date: 5 July 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1055

zbMATH Keywords

\(\omega\)-automatatask decompositionsystem complexitytask-relative homomorphic reduction

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Compositional synthesis of modular systems ⋮ Symbolic graphs: Linear solutions to connectivity related problems ⋮ An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps ⋮ Compositional SCC analysis for language emptiness

This page was built for publication: Testing language containment for \(\omega\)-automata using BDDs