Classes of formal grammars
From MaRDI portal
Publication:1248342
DOI10.1007/BF01246366zbMath0381.68061OpenAlexW2078702232MaRDI QIDQ1248342
Publication date: 1975
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01246366
Uses Software
Cites Work
- A syntax-specification system for patterns
- A limit theorem for set of subwords in deterministic TOL laguages
- On derivation trees of indexed grammars - an extension of the uvwxy- theorem
- Generalized overlap resolvable grammars and their parsers
- Controlled pushdown automata
- Normal forms for context-sensitive grammars
- Theory of formal grammars
- The unsolvability of the equality problem for sentential forms of context-free grammars
- Relationships between nondeterministic and deterministic tape complexities
- Time- and tape-bounded Turing acceptors and AFLs
- Tape-bounded Turing acceptors and principal AFLs
- A contect-free language and enumeration problems on infinite trees and digraphs
- Une généralisation des ensembles de Dyck
- Three theorems concerning principal AFLs
- Picture processing grammar and its applications
- On the inherent ambiguity of simple tuple languages
- Plex languages
- A characterization of two-way deterministic classes of languages
- On stochastic context-free languages
- A characterization of context-free languages
- LR(k) grammars and deterministic languages
- A note on scattered context grammars
- Substitution expressions
- General formulation of formal grammars
- Finite-turn checking automata
- Efficient LR(1) parsers
- AFL with the semilinear property
- A context-free syntax of ALGOL 68
- Writing stack acceptors
- Locally testable languages
- A homomorphism theorem for weighted context-free grammars
- Direction controlled programmed grammars
- Absolutely parallel grammars and two-way finite-state transducers
- Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives
- On AFL generators for finitely encoded AFA
- A generalization of Parikh's semilinear theorem
- On the extension of Gladkij's theorem and the hierarchies of languages
- Web grammars and several graphs
- LR-regular grammars - an extension of LR(k) grammars
- Characterizations of locally testable events
- On two-way multihead automata
- Selection of digitivity of numbers in the transmission of data concerning the probabilistic characteristics of a process
- A note on leftmost restricted random context grammars
- Some concepts for languages more powerful than context-free
- On sentential forms of context-free grammars
- Optimization of LR(k) parsers
- The equivalence problem for deterministic TOL-systems is undecidable
- Real-time language recognition by one-dimensional cellular automata
- Periodic representation of equal matrix grammars
- The Hardest Context-Free Language
- Covering-languages of grammars
- Deterministic Pushdown Store Machines and Real-Time Computation
- Probabilistic automata
- An efficient context-free parsing algorithm
- Mappings and grammars on trees
- Characteristic and ultrarealtime languages
- A note on some systems of lindenmayer
- A context-free language which is not acceptable by a probabilistic automaton
- Some closure properties of the family of stochastic languages
- Simple matrix languages
- Cap expressions for context-free languages
- Characterizations of transductions defined by abstract families of transducers
- Generation of Right-Linear Grammars from Regular Expressions
- Images of AFL under certain families of homomorphisms
- Two-way sequential transductions and stack automata
- A note on a decomposition theorem for simple deterministic languages
- Some inherently ambiguous context-free languages
- Probabilistic tree automata
- Unambiguous equal matrix languages
- Multi-stack-counter languages
- The structure generating function and entropy of tuple languages
- A note on AFLs and bounded erasing
- Complexity and unambiguity of context-free grammars and languages
- Multitape AFA
- Matrix grammars with a leftmost restriction
- A few remarks on the index of context-free grammars and languages
- On 0L-Languages
- Some decidability results on grammatical inference and complexity
- On a Class of Stochastic Languages
- On the Languages Representable by Finite Probabilistic Automata
- On the Execution of Fuzzy Programs Using Finite-State Machines
- Probabilistic grammars and automata
- Translations on a context free grammar
- Approximation of weighted type 0 languages by formal power series
- An Algorithm for the Design of Simple Precedence Grammars
- String adjunct grammars: I. Local and distributed adjunction
- String adjunct grammars: II. Equational representation, null symbols, and linguistic relevance
- On permuting letters of words in context-free languages
- Equational languages
- Some restrictive devices for context-free grammars
- Erasing in context-free AFLs
- Epimorphisms in certain categories of transducers
- Some results in tree automata
- Generation of regular expressions for automata by the integral of regular expressions
- Structured Storage AFA
- Weak and Mixed Strategy Precedence Parsing
- Uniform tag sequences
- Sur l'extension et la restriction d'un langage associé à l'espace conmathrmuel
- Sur la restriction maximale d'un langage
- On ordered context-free grammars
- Language types and logical theorems
- Simple matrix languages with a leftmost restriction
- Nonsequential languages
- Propriétés booléennes des langages stochastiques
- On matrix languages
- Finite-state probabilistic languages
- Some remarks on state grammars and matrix grammars
- A medvedev characterization of sets recognized by generalized finite automata
- On the structure of context-sensitive grammars
- Intersection-closed full AFL and the recursively enumerable languages
- Abstract families of relations
- 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
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
