Pages that link to "Item:Q1403252"
From MaRDI portal
The following pages link to Conjunctive grammars and systems of language equations (Q1403252):
Displaying 23 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← links)
- One-nonterminal conjunctive grammars over a unary alphabet (Q639852) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- Language equations with complementation: decision problems (Q880178) (← links)
- Decision problems for language equations (Q972384) (← links)
- Solving systems of explicit language relations (Q1389764) (← links)
- On the closure properties of linear conjunctive languages. (Q1874415) (← links)
- Boolean grammars (Q1886037) (← links)
- Language equations (Q2074222) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Two-sided context specifications in formal grammars (Q2354409) (← links)
- The dual of concatenation (Q2575759) (← links)
- LINEAR CONJUNCTIVE GRAMMARS AND ONE-TURN SYNCHRONIZED ALTERNATING PUSHDOWN AUTOMATA (Q2941092) (← links)
- On language equations with concatenation and various sets of Boolean operations (Q3465630) (← links)
- CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES (Q3538852) (← links)
- Conjunctive Grammars with Restricted Disjunction (Q3599090) (← links)
- (Q4418614) (← links)
- On the equivalence of linear conjunctive grammars and trellis automata (Q4825389) (← links)
- A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS (Q5704378) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
- Least and greatest solutions of equations over sets of integers (Q5964016) (← links)
