Safety and liveness of -context-free languages

DOI10.1016/0020-0190(91)90244-CMaRDI QIDQ811129zbMATH OpenFDO

Authors Soma Chaudhuri, Richard E. Ladner

Publication date 1991

Published in Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• \(\omega\)-power context-free languages and their closure properties
• Characterization and closure properties of linear \(\omega\)-languages
• Ambiguity in omega context free languages
• scientific article; zbMATH DE number 4088952
• Theory Is Forever

Cites work

• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Adherences of languages
• Proving the Correctness of Multiprocess Programs
• Recognizing safety and liveness
• Theory of -languages. I: Characterizations of -context- free languages
• Theory of -languages. II: A study of various models of - type generation and recognition

Cited in

(2)

• Automata, Languages and Programming
• Computer Aided Verification

This page was built for publication: Safety and liveness of \(\omega\)-context-free languages

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