Programmed Grammars and Classes of Formal Languages
From MaRDI portal
Publication:5573388
DOI10.1145/321495.321504zbMath0182.02004OpenAlexW2099683082WikidataQ127782725 ScholiaQ127782725MaRDI QIDQ5573388
Publication date: 1969
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321495.321504
Related Items (78)
A general theory of translation ⋮ One-Sided Random Context Grammars with Leftmost Derivations ⋮ From regulated rewriting to computing with membranes: collapsing hierarchies ⋮ Petri net algorithms in the theory of matrix grammars ⋮ The power of programmed grammars with graphs from various classes ⋮ Network languages for intelligent control ⋮ Network languages for concurrent multiagent systems ⋮ Pumping lemmas for the control language hierarchy ⋮ Characterizations and extensions of pushdown translations ⋮ On the degree of synchronization of k1TOL and k1ETOL systems ⋮ Multilevel synthesis of structured programs ⋮ Inferability of context-free programmed grammars ⋮ Accepting grammars with regulation ⋮ Multipass precedence analysis ⋮ On vector languages ⋮ ON PARALLELISM IN COLONIES ⋮ Monotonically controlling right linear grammars with unknown behaviors to output a target string ⋮ Nonterminal complexity of programmed grammars. ⋮ Programmed OL-systems ⋮ Iterated linear control and iterated one-turn pushdowns ⋮ Fundamental methodological issues of syntactic pattern recognition ⋮ Stochastic grammars and languages ⋮ Extension of tabled 0L-systems and languages ⋮ Bicolored digraph grammar systems ⋮ On the generative power of sequential and parallel programmed graph grammars ⋮ 2DST mappings of languages and related problems ⋮ On the structure of context-sensitive grammars ⋮ On some derivation mechanisms and the complexity of their Szilard languages ⋮ LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES ⋮ Unnamed Item ⋮ On the index of positive programmed formal languages ⋮ 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 ⋮ Upper bounds on recognition of a hierarchy of non-context-free languages ⋮ Reducing control alphabet size for the control of right linear grammars with unknown behaviors ⋮ On the complexity of finite, pushdown, and stack automata ⋮ On coupled languages and translations ⋮ The membership question for ETOL-languages is polynomially complete ⋮ ETOL-grammars and N-grammars ⋮ A model for the formal definition of programming languages ⋮ Size, index, and context-sensitivity of controlled partition grammars ⋮ Six nonterminals are enough for generating each r.e. language by a matrix grammar ⋮ 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 ⋮ 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 ⋮ ON THE TERMINATING DERIVATION MODE IN COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH FORBIDDING COMPONENTS ⋮ Priorities on context conditions in rewriting systems ⋮ Rewriting systems with a clocking mechanism ⋮ On representing recursively enumerable languages by internal contextual languages ⋮ A hierarchy between context-free and context-sensitive languages ⋮ On stochastic context-free languages ⋮ A note on scattered context grammars ⋮ PROGRAMMED GRAMMARS WITH RULE QUEUES ⋮ General formulation of formal grammars ⋮ On the Complexity of Szilard Languages of Regulated Grammars ⋮ Direction controlled programmed grammars ⋮ A note on leftmost restricted random context grammars ⋮ Some concepts for languages more powerful than context-free ⋮ On the languages generated by context-sensitive fuzzy grammars ⋮ ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS ⋮ Normal forms for context-sensitive grammars ⋮ Inference of a class of CFPG by means of semantic rules ⋮ Theory of formal grammars ⋮ Network languages for complex systems ⋮ A linguistic approach to geometric reasoning ⋮ A note on Parikh maps, abstract languages, and decision problems ⋮ On the computational completeness of matrix simple semi-conditional grammars ⋮ A variant of random context grammars: Semi-conditional grammars ⋮ Fuzzy state grammar and fuzzy deep pushdown automaton ⋮ Translations of network languages
This page was built for publication: Programmed Grammars and Classes of Formal Languages
