Programmed Grammars and Classes of Formal Languages

Cited in

(80)

A note on Parikh maps, abstract languages, and decision problems
A variant of random context grammars: Semi-conditional grammars
On the degree of synchronization of k1TOL and k1ETOL systems
Programmed OL-systems
On the generative power of sequential and parallel programmed graph grammars
2DST mappings of languages and related problems
Upper bounds on recognition of a hierarchy of non-context-free languages
The membership question for ETOL-languages is polynomially complete
ETOL-grammars and N-grammars
Context-free grammars with graph-controlled tables
More on ETOL systems versus random context grammars
Hypergrammars: An extension of macrogrammars
Degree-languages: A new concept of acceptance
Control sets on context-free grammar forms
Conditional Grammars
A useful lemma for context-free programmed grammars
On representing recursively enumerable languages by internal contextual languages
Network languages for complex systems
A linguistic approach to geometric reasoning
Translations of network languages
Petri net algorithms in the theory of matrix grammars
Network languages for intelligent control
Network languages for concurrent multiagent systems
Multipass precedence analysis
On vector languages
Nonterminal complexity of programmed grammars.
Normal forms for context-sensitive grammars
Theory of formal grammars
From regulated rewriting to computing with membranes: collapsing hierarchies
Reducing control alphabet size for the control of right linear grammars with unknown behaviors
On the computational completeness of matrix simple semi-conditional grammars
Monotonically controlling right linear grammars with unknown behaviors to output a target string
On some derivation mechanisms and the complexity of their Szilard languages
A hierarchy between context-free and context-sensitive languages
On stochastic context-free languages
A note on scattered context grammars
General formulation of formal grammars
Direction controlled programmed grammars
A note on leftmost restricted random context grammars
Some concepts for languages more powerful than context-free
On the complexity of Szilard languages of regulated grammars
One-sided random context grammars with leftmost derivations
Multilevel synthesis of structured programs
Inferability of context-free programmed grammars
Six nonterminals are enough for generating each r.e. language by a matrix grammar
Programmed grammars with rule queues
ON THE TERMINATING DERIVATION MODE IN COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH FORBIDDING COMPONENTS
scientific article; zbMATH DE number 3817693 (Why is no real title available?)
Iterated linear control and iterated one-turn pushdowns
A linked forest manipulation system syntax rules for an attributed translation grammar for PL/0
A linked forest manipulation system semantics rules for an attributed translation grammar for PL/0
On the languages generated by context-sensitive fuzzy grammars
Inference of a class of CFPG by means of semantic rules
ON PARALLELISM IN COLONIES
Stochastic grammars and languages
Extension of tabled 0L-systems and languages
On the complexity of finite, pushdown, and stack automata
On coupled languages and translations
Size, index, and context-sensitivity of controlled partition grammars
The complexity of the membership problem for some extensions of context-free languagest†
Homomorphism equivalence on etol languages†
An algebraic technique for context-sensitive parsing
Parsers for indexed grammars
Pumping lemmas for the control language hierarchy
Accepting grammars with regulation
LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES
A model for the formal definition of programming languages
On the leftmost derviation in matrix grammars
Fuzzy state grammar and fuzzy deep pushdown automaton
A general theory of translation
Characterizations and extensions of pushdown translations
Bicolored digraph grammar systems
On the structure of context-sensitive grammars
Remarks on context-free grammars with subregular control languages
On the index of positive programmed formal languages
\(\mathrm{LL}(k)\) cooperating distributed grammar systems
Priorities on context conditions in rewriting systems
Rewriting systems with a clocking mechanism
The power of programmed grammars with graphs from various classes
Fundamental methodological issues of syntactic pattern recognition

This page was built for publication: Programmed Grammars and Classes of Formal Languages

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