Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Letter to the Editor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain formal properties of grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the boolean properties of context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient recognizer for the Boolean closure of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game-theoretic characterization of Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Families of Languages Related to ALGOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dual of concatenation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive grammars and systems of language equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-founded semantics for Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and parsing of context-free languages in time n3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Context-Free Recognizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: General context-free recognition in less than cubic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of equations over sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A grammatical characterization of alternating pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of exponential-time languages by alternating context- free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive grammars and alternating pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Context-Free Languages and Linear Time μ-Calculus with Sequential Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unambiguous Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive grammars with restricted disjunction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Normal-Form Theorem for Context-Free Phrase Structure Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for language equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally stratified Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOOLEAN FUZZY SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unambiguous Conjunctive Grammars over a One-Letter Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way bounded cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic trellis automatata † / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic trellis automata: Stability, decidability and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and computational complexity of systolic trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of linear conjunctive grammars and trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations of the firing squad problem and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 8-state minimal time solution to the firing squad synchronization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On real time one-way cellular array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of real-time trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On time computability of functions in one-way cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient context-free parsing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition and parsing algorithm for arbitrary conjunctive grammars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the translation of languages from left to right / rank
 
Normal rank
Property / cites work
 
Property / cites work: LR parsing for conjunctive grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntax-Directed Transduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down parsing of conjunctive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive descent parsing for Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressive power of \(\text{LL}(k)\) Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Conjunctive Grammars and One-Turn Synchronized Alternating Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast on-line integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsing Boolean grammars over a one-letter alphabet using online convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Integer Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardest linear conjunctive language / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple P-complete problem and its language-theoretic representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Completeness of Equations over Sets of Natural Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing hyper-arithmetical sets by equations over sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON EQUATIONS OVER SETS OF NUMBERS AND THEIR LIMITATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Language Equations XXK = XXL and XM = N over a Unary Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commutative grammars: The complexity of uniform word problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of nonterminals in linear conjunctive grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of univariate equations over sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-nonterminal conjunctive grammars over a unary alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2893311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the closure properties of linear conjunctive languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence and containment problems for context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some subclasses of context-free languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrestricted complementation in language equations over a one-letter alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language equations with complementation: decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language equations with complementation: expressive power / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational queries computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree adjunct grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A further note on top-down deterministic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms Preserving Deterministic Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preservation of unambiguity and inherent ambiguity in context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Complexity of Operations on Input-Driven Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOOLEAN GRAMMARS AND GSM MAPPINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations Which Preserve Definability in Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardest Context-Free Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5192986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive and Boolean grammars: the true general case of the context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-hardness of the emptiness problem for visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct algorithm for checking equivalence of LL(k) grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inclusion problem for simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(A)=L(B)\)? decidability results from complete formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equations X + A = B and (X + X) + C = (X − X) + D over Sets of Natural Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic models and ambiguity of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on top-down languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining Contexts in Context-Free Grammars / rank
 
Normal rank

Latest revision as of 06:35, 7 July 2024

scientific article
Language Label Description Also known as
English
Conjunctive and Boolean grammars: the true general case of the context-free grammars
scientific article

    Statements

    Conjunctive and Boolean grammars: the true general case of the context-free grammars (English)
    0 references
    0 references
    28 January 2014
    0 references
    formal languages
    0 references
    context-free grammars
    0 references
    conjunctive grammars
    0 references
    Boolean grammars
    0 references
    parsing
    0 references
    language equations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers