scientific article; zbMATH DE number 7439734

zbMath1478.03035arXiv1609.04092MaRDI QIDQ5015272

Florian Bruse

Publication date: 7 December 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
• Fixed point characterization of infinite behavior of finite-state systems
• A call-by-name lambda-calculus machine
• The alternation hierarchy in fixpoint logic with chop is strict too
• Alternating Parity Krivine Automata
• Visibly pushdown languages
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• CONCUR 2004 - Concurrency Theory
• The modal mu-calculus alternation hierarchy is strict

This page was built for publication: