The hardest linear conjunctive language
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3978426 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1948516 (Why is no real title available?)
- scientific article; zbMATH DE number 1747449 (Why is no real title available?)
- A recognition and parsing algorithm for arbitrary conjunctive grammars.
- On real-time cellular automata and trellis automata
- On the closure properties of linear conjunctive languages.
Cited in
(10)- The hardest \(\operatorname{LL}(k)\) language
- Complexity of equations over sets of natural numbers
- A Simple P-Complete Problem and Its Representations by Language Equations
- On the number of nonterminals in linear conjunctive grammars
- Unambiguous Boolean grammars
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- A simple P-complete problem and its language-theoretic representations
- scientific article; zbMATH DE number 1948516 (Why is no real title available?)
- The hardest language for conjunctive grammars
- Hardest languages for conjunctive and Boolean grammars
This page was built for publication: The hardest linear conjunctive language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007613)
