Safety and liveness of -context-free languages

DOI10.1016/0020-0190(91)90244-CzbMATH Open0734.68056MaRDI QIDQ811129FDOQ811129

Authors: Soma Chaudhuri, Richard E. Ladner 

Publication date: 1991

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

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

Mathematics Subject Classification ID

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

Cites Work

• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proving the Correctness of Multiprocess Programs
• Recognizing safety and liveness
• Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
• Adherences of languages

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)