FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5465872
DOI10.1007/b104325zbMath1117.68409MaRDI QIDQ5465872
P. Madhusudan, Christof Löding, Olivier Serre
Publication date: 12 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104325
91A43: Games involving graphs
68Q45: Formal languages and automata
03E15: Descriptive set theory
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Unnamed Item, Ramsey-Based Inclusion Checking for Visibly Pushdown Automata, Branching-time logics with path relativisation, Visibly pushdown modular games, Weighted automata and logics for infinite nested words, Regular languages of nested words: fixed points, automata, and synchronization, Pushdown module checking, Visibly linear dynamic logic, Visibly rational expressions, Propositional dynamic logic with recursive programs, An Automata-Theoretic Approach to Infinite-State Systems