On the generative power of \(\omega \)-grammars and \(\omega \)-automata

zbMATH Open1236.68124arXiv1308.4516MaRDI QIDQ2882380

Zhe Chen

Publication date: 4 May 2012

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.4516

zbMATH Keywords

generative power\(\omega \)-automaton\(\omega \)-language\(\omega \)-grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Title not available (Why is that?) ⋮ Mechanizing the Powerset Construction for Restricted Classes of ω-Automata

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Finitely generated \(\omega\)-languages 👍 👎
• On generators of rational \(\omega\)-power languages 👍 👎
• \(\omega\)-power context-free languages and their closure properties 👍 👎
• \( \omega \)-automata 👍 👎
• Automata and languages generalized to \(\omega\)-continuous semirings 👍 👎
• Mechanizing the Powerset Construction for Restricted Classes of ω-Automata 👍 👎
• ω-Automata 👍 👎

This page was built for publication: On the generative power of \(\omega \)-grammars and \(\omega \)-automata

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