The finite graph problem for two-way alternating automata.
type: Item
instance of: scholarly article
title: The finite graph problem for two-way alternating automata.
zbMATH Open document ID: 1052.68069
DOI: 10.1016/S0304-3975(02)00866-6
author: Mikołaj Bojańczyk
published in: Theoretical Computer Science
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 1915472
zbMATH Keywords: Alternating automata
zbMATH Keywords: Finite model
zbMATH Keywords: \(\mu\)-calculus
MaRDI profile type: Publication
cites work: Modal languages and bounded fragments of predicate logic
cites work: On the Restraining Power of Guards
cites work: Loosely guarded fragment of first-order logic has the finite model property
cites work: Results on the propositional \(\mu\)-calculus
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q5616162
cites work: Alternating tree automata
cites work: Q4219045
cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees
full work available at URL: s0304-3975(02)00866-6
OpenAlex ID: W2658457120
description: scientific article; zbMATH DE number 1915472