Theory of formal grammars
type: Item
instance of: scholarly article
title: Theory of formal grammars
zbMATH Open document ID: 0287.68044
DOI: 10.1007/BF01085017
author: A. V. Gladkii
author: Alexandre Dikovsky
published in: Journal of Soviet Mathematics
publication date: 1974-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68-01
zbMATH DE Number: 3451465
MaRDI profile type: Publication
cites work: On the relation between the class of all context-free languages and the class of deterministic context-free languages
cites work: Minimization of the complexity function in the class of pushdown store automata and categorial grammars of complexity three
cites work: Q5640741
cites work: Indexed Grammars—An Extension of Context-Free Grammars
cites work: Nested Stack Automata
cites work: The theory of languages
cites work: Syntax directed translations and the pushdown assembler
cites work: Properties of syntax directed translations
cites work: ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
cites work: An analog of a theorem about context-free languages
cites work: Tree generating regular systems
cites work: A Universal Syntax-Directed Top-Down Analyzer
cites work: Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
cites work: Q5620339
cites work: Degrees of Unsolvability in Formal Grammars
cites work: An efficient context-free parsing algorithm
cites work: Random-Access Stored-Program Machines, an Approach to Programming Languages
cites work: Counter machines and counter languages
cites work: Grammars with partial ordering of the rules
cites work: Q4044474
cites work: Dependency systems and phrase-structure systems
cites work: Recognition time of context-free languages by on-line Turing machines
cites work: Q5576254
cites work: Studies in abstract families of languages
cites work: Principal AFL
cites work: Stack automata and compiling
cites work: One-way stack automata
cites work: Bracketed context-free languages
cites work: On the closure of AFL under reversal
cites work: A mathematical model of transformational grammars
cites work: A note on preservation of languages by transducers
cites work: On the existence of generators for certain AFL
cites work: Control sets on grammars
cites work: Derivation-bounded languages
cites work: Substitution in families of languages
cites work: A note on undecidable properties of formal languages
cites work: An Infinite Hierarchy of Context-Free Languages
cites work: Checking automata and one-way stack languages
cites work: Chains of full AFL's
cites work: Full AFLs and nested iterated substitution
cites work: Scattered context grammars
cites work: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
cites work: Q5551465
cites work: Some classifications of context-free languages
cites work: A Grammatical Characterization of One-Way Nondeterministic Stack Languages
cites work: On Memory Requirements for Context-Free Language Recognition
cites work: What makes some language theory problems undecidable
cites work: Q5555692
cites work: A generalization of context-free determinism
cites work: On the equivalence and containment problems for context-free languages
cites work: Sets accepted by one-way stack automata are context sensitive
cites work: Q5592246
cites work: Simple matrix languages
cites work: Every semilinear set is a finite union of disjoint linear sets
cites work: Context-free languages and rudimentary attributes
cites work: A note on the index of a context-free language
cites work: Note on tape reversal complexity of languages
cites work: The noncomputability of the channel capacity of context-sensitive languages
cites work: A hierarchy between context-free and context-sensitive languages
cites work: A note on computing time for recognition of languages generated by linear grammars
cites work: A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
cites work: Predicates definable over transformational derivations by intersection with regular languages
cites work: Representability of nonregular languages in finite probabilistic automata
cites work: A characterization of parenthesis languages
cites work: Semantics of context-free languages
cites work: Some unsolvable problems on context-free languages and their application to on-line language recognizers

Theory of formal grammars (cites work)
cites work: Classification of formal languages by functional binary transductions

Theory of formal grammars (cites work)
cites work: A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free

Theory of formal grammars (cites work)
cites work: On the entropy of context-free languages

Theory of formal grammars (cites work)
cites work: Q5588671

Theory of formal grammars (cites work)
cites work: Q5630562

Theory of formal grammars (cites work)
cites work: Notes on top-down languages

Theory of formal grammars (cites work)
cites work: Syntax-Directed Transduction

Theory of formal grammars (cites work)
cites work: A characterization of semilinear sets

Theory of formal grammars (cites work)
cites work: Writing pushdown acceptors

Theory of formal grammars (cites work)
cites work: Probabilistic tree automata and context free languages

Theory of formal grammars (cites work)
cites work: A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language

Theory of formal grammars (cites work)
cites work: A note on the complement of inherently ambiguous context-free languages

Theory of formal grammars (cites work)
cites work: The solution of a problem by Ginsburg

Theory of formal grammars (cites work)
cites work: A note on enumerable grammars

Theory of formal grammars (cites work)
cites work: Parenthesis Grammars

Theory of formal grammars (cites work)
cites work: Algebraic automata and context-free sets

Theory of formal grammars (cites work)
cites work: Separable graphs, planar graphs and web grammars

Theory of formal grammars (cites work)
cites work: Q5608771

Theory of formal grammars (cites work)
cites work: Transductions des langages de Chomsky

Theory of formal grammars (cites work)
cites work: A helpful result for proving inherent ambiguity

Theory of formal grammars (cites work)
cites work: Définition et etude des Bilangages réguliers

Theory of formal grammars (cites work)
cites work: Structural equivalence of context-free grammars

Theory of formal grammars (cites work)
cites work: On restricting the base component of transformational grammars

Theory of formal grammars (cites work)
cites work: On the generative power of transformational grammars

Theory of formal grammars (cites work)
cites work: An efficient syntactic analyser of certain formal languages

Theory of formal grammars (cites work)
cites work: Complexity of grammars by group theoretic methods

Theory of formal grammars (cites work)
cites work: Closures which preserve finiteness in families of languages

Theory of formal grammars (cites work)
cites work: A machine realization of the linear context-free languages

Theory of formal grammars (cites work)
cites work: On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages

Theory of formal grammars (cites work)
cites work: Q5616144

Theory of formal grammars (cites work)
cites work: Matrix Equations and Normal Forms for Context-Free Grammars

Theory of formal grammars (cites work)
cites work: Programmed Grammars and Classes of Formal Languages

Theory of formal grammars (cites work)
cites work: Properties of deterministic top-down grammars

Theory of formal grammars (cites work)
cites work: Q5576255

Theory of formal grammars (cites work)
cites work: On the index of a context-free grammar and language

Theory of formal grammars (cites work)
cites work: Q5588667

Theory of formal grammars (cites work)
cites work: Probabilistic and weighted grammars

Theory of formal grammars (cites work)
cites work: Periodically time-variant context-free grammars

Theory of formal grammars (cites work)
cites work: The generative capacity of transformational grammars of ginsburg and partee

Theory of formal grammars (cites work)
cites work: On equal matrix languages

Theory of formal grammars (cites work)
cites work: A Characterization of Semilinear Sets

Theory of formal grammars (cites work)
cites work: Channel capacity of equal matrix languages

Theory of formal grammars (cites work)
cites work: A regularity test for pushdown machines

Theory of formal grammars (cites work)
cites work: Property grammars and table machines

Theory of formal grammars (cites work)
cites work: A note on computing time for the recognition of context-free languages by a single-tape Turing machine

Theory of formal grammars (cites work)
cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Theory of formal grammars (cites work)
cites work: Generalized sequential machine maps

Theory of formal grammars (cites work)
cites work: On stochastic languages

Theory of formal grammars (cites work)
cites work: Partial algorithm problems for context free languages

Theory of formal grammars (cites work)
cites work: A global parser for context-free phrase structure grammars

Theory of formal grammars (cites work)
cites work: Zwei Operationen zwischen Chomsky‐Grammatiken

Theory of formal grammars (cites work)
cites work: Q5609391

Theory of formal grammars (cites work)
cites work: Q5623237

Theory of formal grammars (cites work)
cites work: Deterministic context-sensitive languages: Part I

Theory of formal grammars (cites work)
cites work: Deterministic context-sensitive languages: Part II

Theory of formal grammars (cites work)
cites work: A note on top-down deterministic languages

Theory of formal grammars (cites work)
cites work: A generalised normal form theorem for context-free grammars

Theory of formal grammars (cites work)
cites work: Context-sensitive parsing

Theory of formal grammars (cites work)
cites work: Transition network grammars for natural language analysis

Theory of formal grammars (cites work)
cites work: Inclusion relations among families of context-free languages

Theory of formal grammars (cites work)
cites work: Recognition and parsing of context-free languages in time n3