Pages that link to "Item:Q1246271"
From MaRDI portal
The following pages link to A representation of trees by languages. I (Q1246271):
Displaying 18 items.
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Some negative results concerning DPDA's (Q1058306) (← links)
- On branching and looping. I (Q1134530) (← links)
- A hierarchy of deterministic languages (Q1136238) (← links)
- A closure property of deterministic context-free languages (Q1149789) (← links)
- The simultaneous accessibility of two configurations of two equivalent DPDA's (Q1152220) (← links)
- Recursion-closed algebraic theories (Q1157899) (← links)
- A hierarchy of real-time deterministic languages and their equivalence (Q1165588) (← links)
- The tree equivalence of linear recursion schemes (Q1575234) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- A note on ordinal DFAs (Q1943687) (← links)
- Model-Checking Games for Typed λ-Calculi (Q2864164) (← links)
- An axiomatic approach to the Korenjak-Hopcroft algorithms (Q3703289) (← links)
- Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)
- (Q4192947) (← links)
- (Q4972735) (← links)
