Progress measures, immediate determinacy, and a subset construction for tree automata
type: Item
instance of: scholarly article
title: Progress measures, immediate determinacy, and a subset construction for tree automata
zbMATH Open document ID: 0821.68084
DOI: 10.1016/0168-0072(94)90086-8
author: Nils Klarlund
published in: Annals of Pure and Applied Logic
publication date: 1995-09-19T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 91A99
zbMATH DE Number: 683708
zbMATH Keywords: tree automata
zbMATH Keywords: immediate determinacy
zbMATH Keywords: forgetful determinacy
MaRDI profile type: Publication
full work available at URL: 0168-0072(94)90086-8
OpenAlex ID: W2059837071
cites work: Q5525343
cites work: Q4143272
cites work: Q3203012
cites work: Q5817866
cites work: Progress measures and stack assertions for fair termination
cites work: Borel determinacy
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Alternating automata on infinite trees
cites work: Q5541339
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q5573961
cites work: The complementation problem for Büchi automata with applications to temporal logic
cites work: A combinatorial approach to the theory of ω-automata
cites work: Q4385530
cites work: Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies
description: scientific article; zbMATH DE number 683708