Theory of formal grammars

Cites work

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

Cited in

(1)

Classes of formal grammars

This page was built for publication: Theory of formal grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1846334)