scientific article; zbMATH DE number 7770053

arXiv2105.00452MaRDI QIDQ6070605

Ilkka Törmä, Pierre Marcus

Publication date: 23 November 2023

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

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

zbMATH Keywords

regular languagesstate complexitywinning sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• PSPACE-completeness of majority automata networks
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Shattering news
• Order shattering and Wilson's theorem
• Descriptional complexity of winning sets of regular languages
• Descriptional Complexity of Bounded Regular Languages
• Playing with Subshifts
• Alternation
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• Characterizing regular languages with polynomial densities
• On winning shifts of marked uniform substitutions
• Classification of sofic projective subdynamics of multidimensional shifts of finite type

This page was built for publication: