scientific article; zbMATH DE number 1747449
From MaRDI portal
Publication:4531380
Recommendations
Cited in
(84)- Input-driven languages are linear conjunctive
- Distributional learning of conjunctive grammars and contextual binary feature grammars
- Learning conjunctive grammars and contextual binary feature grammars
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
- Path querying on acyclic graphs using Boolean grammars
- An Introduction to Grammar Convergence
- Conjunctive Grammars with Restricted Disjunction
- Conjunctive grammars in Greibach normal form and the Lambek calculus with additive connectives
- The hardest language for grammars with context operators
- On hardest languages for one-dimensional cellular automata
- Finding the smallest binarization of a CFG is NP-hard
- The Hardest LL(k) Language
- One-Nonterminal Conjunctive Grammars over a Unary Alphabet
- Non-closure under complementation for unambiguous linear grammars
- The hardest language for conjunctive grammars
- Generalized LR parsing for grammars with contexts
- Least and greatest solutions of equations over sets of integers
- Inductive definitions in logic versus programs of real-time cellular automata
- On Equations over Sets of Numbers and Their Limitations
- Path querying with conjunctive grammars by matrix multiplication
- On state-alternating context-free grammars
- A tale of conjunctive grammars
- Locally stratified Boolean grammars
- Model checking propositional dynamic logic with all extras
- On the equivalence of linear conjunctive grammars and trellis automata
- Improved normal form for grammars with one-sided contexts
- The hardest \(\operatorname{LL}(k)\) language
- Conjunctive grammars and alternating pushdown automata
- Comparing linear conjunctive languages to subfamilies of the context-free languages
- Probabilistic conjunctive grammar
- Two-sided context specifications in formal grammars
- Conjunctive grammars with restricted disjunction
- Language equations with complementation: expressive power
- A game-theoretic characterization of Boolean grammars
- \(LR(0)\) conjunctive grammars and deterministic synchronized alternating pushdown automata
- Fundamental methodological issues of syntactic pattern recognition
- The hardest linear conjunctive language
- Complexity of equations over sets of natural numbers
- On the expressive power of univariate equations over sets of natural numbers
- Grammatical unification
- Conjunctive categorial grammars
- Language equations
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
- Boolean grammars
- Expressive power of \(\text{LL}(k)\) Boolean grammars
- Recursive descent parsing for Boolean grammars
- Expressiveness and complexity of graph logic
- Computational completeness of equations over sets of natural numbers
- Alternating two-way AC-tree automata
- Separating systems of conjunctions.
- On the number of nonterminals in linear conjunctive grammars
- Unambiguous Boolean grammars
- Parsing by matrix multiplication generalized to Boolean grammars
- Unresolved systems of language equations: expressive power and decision problems
- A Game-Theoretic Characterization of Boolean Grammars
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- 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 1962782 (Why is no real title available?)
- The dual of concatenation
- scientific article; zbMATH DE number 2040923 (Why is no real title available?)
- On Alternating Phrase-Structure Grammars
- Decision problems for language equations
- Well-founded semantics for Boolean grammars
- Linear grammars with one-sided contexts and their automaton representation
- Representing hyper-arithmetical sets by equations over sets of integers
- One-nonterminal conjunctive grammars over a unary alphabet
- On the complexity of the string generation problem
- Unambiguous conjunctive grammars over a one-symbol alphabet
- Recognizing two-sided contexts in cubic time
- Parsing Boolean grammars over a one-letter alphabet using online convolution
- Equations over sets of integers with addition only
- An extension of context-free grammars with one-sided context specifications
- On the closure properties of linear conjunctive languages.
- On hardest languages for one-dimensional cellular automata
- Linear-space recognition for grammars with contexts
- Distributional learning of parallel multiple context-free grammars
- Top-down parsing of conjunctive languages
- The language intersection problem for non-recursive context-free grammars
- scientific article; zbMATH DE number 2155200 (Why is no real title available?)
- Generalized LR parsing algorithm for grammars with one-sided contexts
- Hardest languages for conjunctive and Boolean grammars
- A recognition and parsing algorithm for arbitrary conjunctive grammars.
- Conjunctive grammars and systems of language equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531380)
