Theory of formal grammars (Q1846334): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the relation between the class of all context-free languages and the class of deterministic context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of the complexity function in the class of pushdown store automata and categorial grammars of complexity three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5640741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexed Grammars—An Extension of Context-Free Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntax directed translations and the pushdown assembler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of syntax directed translations / rank
 
Normal rank
Property / cites work
 
Property / cites work: ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analog of a theorem about context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree generating regular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Universal Syntax-Directed Top-Down Analyzer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Unsolvability in Formal Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient context-free parsing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-Access Stored-Program Machines, an Approach to Programming Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and counter languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammars with partial ordering of the rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependency systems and phrase-structure systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition time of context-free languages by on-line Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studies in abstract families of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal AFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stack automata and compiling / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way stack automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bracketed context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the closure of AFL under reversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical model of transformational grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on preservation of languages by transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of generators for certain AFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control sets on grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivation-bounded languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitution in families of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on undecidable properties of formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Hierarchy of Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking automata and one-way stack languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chains of full AFL's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full AFLs and nested iterated substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattered context grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some classifications of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Grammatical Characterization of One-Way Nondeterministic Stack Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Memory Requirements for Context-Free Language Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: What makes some language theory problems undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5555692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of context-free determinism / 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: Sets accepted by one-way stack automata are context sensitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple matrix languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every semilinear set is a finite union of disjoint linear sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free languages and rudimentary attributes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the index of a context-free language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on tape reversal complexity of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noncomputability of the channel capacity of context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy between context-free and context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on computing time for recognition of languages generated by linear grammars / 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: Predicates definable over transformational derivations by intersection with regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representability of nonregular languages in finite probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of parenthesis languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some unsolvable problems on context-free languages and their application to on-line language recognizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of formal languages by functional binary transductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the entropy of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on top-down languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntax-Directed Transduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of semilinear sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Writing pushdown acceptors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic tree automata and context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complement of inherently ambiguous context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solution of a problem by Ginsburg / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on enumerable grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parenthesis Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic automata and context-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable graphs, planar graphs and web grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5608771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transductions des langages de Chomsky / rank
 
Normal rank
Property / cites work
 
Property / cites work: A helpful result for proving inherent ambiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Définition et etude des Bilangages réguliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural equivalence of context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricting the base component of transformational grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generative power of transformational grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient syntactic analyser of certain formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of grammars by group theoretic methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closures which preserve finiteness in families of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine realization of the linear context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Equations and Normal Forms for Context-Free Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programmed Grammars and Classes of Formal Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the index of a context-free grammar and language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic and weighted grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodically time-variant context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generative capacity of transformational grammars of ginsburg and partee / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equal matrix languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Semilinear Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel capacity of equal matrix languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regularity test for pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property grammars and table machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on computing time for the recognition of context-free languages by a single-tape Turing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized sequential machine maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stochastic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial algorithm problems for context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global parser for context-free phrase structure grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zwei Operationen zwischen Chomsky‐Grammatiken / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5609391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5623237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic context-sensitive languages: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic context-sensitive languages: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on top-down deterministic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalised normal form theorem for context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-sensitive parsing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition network grammars for natural language analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion relations among families of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and parsing of context-free languages in time n3 / rank
 
Normal rank

Latest revision as of 15:12, 12 June 2024

scientific article
Language Label Description Also known as
English
Theory of formal grammars
scientific article

    Statements

    Theory of formal grammars (English)
    0 references
    0 references
    0 references
    0 references
    1974
    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