Pages that link to "Item:Q5191510"

The following pages link to FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191510):

Displaying 22 items.

• Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
• Regular sets over extended tree structures (Q764339) (← links)
• On the structure of graphs in the Caucal hierarchy (Q930912) (← links)
• An undecidable property of context-free linear orders (Q1944046) (← links)
• Automata on infinite trees (Q2074210) (← links)
• Shelah-Stupp's and Muchnik's iterations revisited (Q2117107) (← links)
• On first-order logic and CPDA graphs (Q2254514) (← links)
• Verification of opacity and diagnosability for pushdown systems (Q2375627) (← links)
• Rewriting higher-order stack trees (Q2411043) (← links)
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
• Iterated pushdown automata and sequences of rational numbers (Q2498918) (← links)
• The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic (Q2672657) (← links)
• The mu-calculus and Model Checking (Q3176384) (← links)
• Rewriting Higher-Order Stack Trees (Q3194729) (← links)
• The Reachability Problem over Infinite Graphs (Q3392937) (← links)
• A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
• Model Transformations in Decidability Proofs for Monadic Theories (Q3540168) (← links)
• An Infinite Automaton Characterization of Double Exponential Time (Q3540169) (← links)
• An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
• On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems (Q5090985) (← links)
• (Q5856415) (← links)
• Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)