The following pages link to (Q4072875):
Displaying 43 items.
- Valuations of languages, with applications to fractal geometry (Q674334) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Polynomial time learning of simple deterministic languages via queries and a representative sample (Q706625) (← links)
- An algebraic characterization of some principal regulated rational cones (Q786546) (← links)
- New families of non real time dpda's and their decidability results (Q799385) (← links)
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- Prime normal form and equivalence of simple grammars (Q860856) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- Conjunctive grammars with restricted disjunction (Q974750) (← links)
- A characterization of s-languages (Q1029050) (← links)
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
- A pumping lemma for real-time deterministic context-free languages (Q1081309) (← links)
- Some observations concerning alternating Turing machines using small space (Q1097697) (← links)
- Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- Iteration theorems for families of strict deterministic languages (Q1143811) (← links)
- Context-free like restrictions on selective rewriting (Q1157178) (← links)
- The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757) (← links)
- The equivalence problem for LL- and LR-regular grammars (Q1162821) (← links)
- A hierarchy of real-time deterministic languages and their equivalence (Q1165588) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- The covering problem for linear context-free grammars (Q1232301) (← links)
- The inclusion problem for simple languages (Q1235014) (← links)
- Equivalence problems for deterministic context-free languages and monadic recursion schemes (Q1238426) (← links)
- A direct algorithm for checking equivalence of LL(k) grammars (Q1238431) (← links)
- Complexity metatheorems for context-free grammar problems (Q1246270) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
- Two decidability results for deterministic pushdown automata (Q1254241) (← links)
- On equivalence of grammars through transformation trees (Q1259173) (← links)
- Simple chain grammars and languages (Q1259175) (← links)
- A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
- A formal specification of document processing (Q1370522) (← links)
- Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521) (← links)
- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320) (← links)
- Polynomial-time identification of very simple grammars from positive data. (Q1874233) (← links)
- The extended equivalence problem for a class of non-real-time deterministic pushdown automata (Q1894681) (← links)
- On decision problems for parameterized machines (Q2268878) (← links)
- Structural equivalence of context-free grammars (Q2534284) (← links)
- Top-down syntax nalysis (Q2551318) (← links)
- Generation, recognition and parsing of context-free languages by means of recursive graphs (Q2559926) (← links)
- Pushdown tree automata (Q3036724) (← links)
