FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5191510
DOI10.1007/b94618zbMath1205.03022OpenAlexW2246750081MaRDI QIDQ5191510
Publication date: 6 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94618
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (22)
Verification of opacity and diagnosability for pushdown systems ⋮ The mu-calculus and Model Checking ⋮ Rewriting Higher-Order Stack Trees ⋮ Choice functions and well-orderings over the infinite binary tree ⋮ Rewriting higher-order stack trees ⋮ Unnamed Item ⋮ The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ An undecidable property of context-free linear orders ⋮ A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ Model Transformations in Decidability Proofs for Monadic Theories ⋮ An Infinite Automaton Characterization of Double Exponential Time ⋮ On the structure of graphs in the Caucal hierarchy ⋮ On first-order logic and CPDA graphs ⋮ The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Iterated pushdown automata and sequences of rational numbers ⋮ The Reachability Problem over Infinite Graphs ⋮ On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems ⋮ Regular sets over extended tree structures ⋮ Automata on infinite trees ⋮ Shelah-Stupp's and Muchnik's iterations revisited
This page was built for publication: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
