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