Pages that link to "Item:Q4825389"
From MaRDI portal
The following pages link to On the equivalence of linear conjunctive grammars and trellis automata (Q4825389):
Displaying 32 items.
- Equations over sets of integers with addition only (Q295632) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- Deletion along trajectories (Q596097) (← links)
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Language equations with complementation: expressive power (Q764318) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Boolean grammars (Q1886037) (← links)
- Language equations (Q2074222) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Conjunctive grammars and alternating pushdown automata (Q2377302) (← links)
- Recognition of poly-slender context-free languages by trellis automata (Q2401759) (← links)
- Computing by commuting. (Q2490820) (← links)
- The dual of concatenation (Q2575759) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- BOOLEAN GRAMMARS AND GSM MAPPINGS (Q3056280) (← links)
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534) (← links)
- NOTES ON DUAL CONCATENATION (Q3401485) (← links)
- HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES (Q5495419) (← links)
- A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS (Q5704378) (← links)
- Formal languages over GF(2) (Q5918612) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)
- Least and greatest solutions of equations over sets of integers (Q5964016) (← links)
- Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)
