The following pages link to (Q4738227):
Displaying 38 items.
- The grammar of mammalian brain capacity (Q290555) (← links)
- Krivine machines and higher-order schemes (Q476196) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Regular sets over extended tree structures (Q764339) (← links)
- On the structure of graphs in the Caucal hierarchy (Q930912) (← links)
- Shelah-Stupp's and Muchnik's iterations revisited (Q2117107) (← links)
- On first-order logic and CPDA graphs (Q2254514) (← links)
- Epsilon-reducible context-free languages and characterizations of indexed languages (Q2280325) (← links)
- Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358) (← links)
- The IO and OI hierarchies revisited (Q2347807) (← links)
- MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies (Q2353402) (← links)
- Verification of opacity and diagnosability for pushdown systems (Q2375627) (← links)
- Rewriting higher-order stack trees (Q2411043) (← links)
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (Q2422040) (← links)
- Contribution of Warsaw logicians to computational logic (Q2422533) (← links)
- Iterated pushdown automata and sequences of rational numbers (Q2498918) (← links)
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic (Q2672657) (← links)
- (Q2842873) (← links)
- Model-Checking Games for Typed λ-Calculi (Q2864164) (← links)
- Finitary Semantics of Linear Logic and Higher-Order Model-Checking (Q2946341) (← links)
- Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence (Q2988360) (← links)
- Krivine Machines and Higher-Order Schemes (Q3012917) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Rewriting Higher-Order Stack Trees (Q3194729) (← links)
- Recursion Schemes and the WMSO+U Logic (Q3304152) (← links)
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (Q3617724) (← links)
- (Q4625705) (← links)
- (Q4993359) (← links)
- Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems (Q5005159) (← links)
- (Q5076057) (← links)
- On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems (Q5090985) (← links)
- (Q5109508) (← links)
- Domains for Higher-Order Games (Q5111275) (← links)
- Streett Automata Model Checking of Higher-Order Recursion Schemes (Q5111330) (← links)
- (Q5119391) (← links)
- (Q5129945) (← links)
- Automata, Logic and Games for the $$\lambda $$ -Calculus (Q5224488) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)