scientific article; zbMATH DE number 3413820

Publication date 1973

Automata and formal grammars in connection with logical questions (03D05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45)

Cited in

(only showing first 100 items - show all)

On the descriptional complexity of scattered context grammars
Membrane computing with transport and embedded proteins
Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way
On the closure of pattern expressions languages under intersection with regular languages
An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations
On the intersection of regex languages with regular languages
On the Hopcroft's minimization technique for DFA and DFCA
Self-assembly of strings and languages
Experiments on the reliability of stochastic spiking neural P systems
On input-revolving deterministic and nondeterministic finite automata
Equality sets of prefix morphisms and regular star languages
Real functions and numbers defined by Turing machines
Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981
Analyse numérique du problème des ondes longues en eau peu profonde
Init and Anf operating on \(\omega\)-languages
Context-free grammar forms with strict interpretations
On subword complexity functions
Complexity and decidability for chain code picture languages
An inverse homomorphic characterization of full principal AFL
Restrictions on NLC graph grammars
Fair derivations in E0L systems
A morphic representation of EOL languages and other ETOL languages
The undecidability of form equivalence for context-free and EOL forms
A variant of random context grammars: Semi-conditional grammars
Truncations of infinite matrices and algebraic series associated with some CF grammars
A note on programmed 0L systems
Traces, dependency graphs and DNLC grammars
On the Chomsky and Stanley's homomorphic characterization of context-free languages
On coordinated selective substitutions: Towards a unified theory of grammars and machines
Pattern selector grammars and several parsing algorithms in the context- free style
Applications of scheduling theory to formal language theory
On the membership problem for regular DNLC grammars
On erasing in E0L forms
Adding global forbidding context to context-free grammars
Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages
Graph theoretic closure properties of the family of boundary NLC graph languages
CTS systems and Petri nets
On the impossibility of the homomorphic characterization of context- sensitive languages
Applications of an infinite square-free co-CFL
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
Several properties of array languages
Grammars, derivation modes and properties of indexed and type-0 languages
On the context-free production complexity of finite languages
Recording the use of memory in right-boundary grammars and push-down automata
On the active and full use of memory in right-boundary grammars and push- down automata
Theory of traces
The OI-hierarchy is closed under control
A pumping result for 2-context-free languages
A representation of recursively enumerable languages by two homomorphisms and a quotient
An arithmetical hierarchy in propositional dynamic logic
A pumping lemma for deterministic context-free languages
A grammatical characterization of alternating pushdown automata
Talking to Sibilla: An approach to context dependent natural language comprehension
Remarks on regulated limited ET0L systems and regulated context-free grammars
Shuffle on trajectories: Syntactic constraints
Tree transducers, L systems, and two-way machines
On recursion in ETOL systems
The characterization of parallel ultralinear grammars by rational power series
On ETOL systems with rank
Codeterministic Lindenmayer schemes and systems
An approach to a unified theory of grammar and L forms
Local constraints in programming languages. I: Syntax
Persistent ETOL systems
On parsing two-level grammars
Context-free grammars with selective rewriting
On generators and generative capacity of EOL forms
Test sets and checking words for homomorphism equivalence
Programmed OL-systems
On epsilon productions for terminals in EOL forms
Interdependent translation schemes
Selective substitution array grammars
A characterization of context-free string languages by directed node- label controlled graph grammars
Colorings and interpretations: a connection between graphs and grammar forms
Decision problems for node label controlled graph grammars
Formes de langages et de grammaires
Languages with homomorphic replacements
On the time and tape complexity of weak unification
Context-free like restrictions on selective rewriting
Concise description of finite languages
A parsing automata approach to LR theory
Recursion and pumping in L forms
Completeness of context-free grammar forms
Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages
The IO- and OI-hierarchies
A homomorphic characterization of regular languages
Grammars with valuations - a discrete model for self-organization of biopolymers
On form-equivalence of deterministic pure grammar forms
Table systems with unconditional transfer
Marvellous interpretations differ little but decisively from ordinary interpretations of EOL forms
A hierarchical pattern description in the syntactic approach to pattern recognition
Basic formulas and languages. I: The theory
Basic formulas and languages. II: Applications to EOL systems and forms
The decidability of the DOL-DTOL equivalence problem
On infinite words obtained by iterating morphisms
The (generalized) Post correspondence problem with lists consisting of two words is decidable
The copying power of one-state tree transducers
On the generative capacity of compound string and array grammars
A note on morphic characterization of languages
Ergodic languages
Abstract grammars based on transductions

This page was built for publication:

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