scientific article
From MaRDI portal
Publication:4040325
zbMath0697.68067MaRDI QIDQ4040325
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Thue and Post systems, etc. (03D03)
Related Items
Cancellation in context-free languages: enrichment by reduction ⋮ Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets ⋮ On Boolean closed full trios and rational Kripke frames ⋮ On languages satisfying “interchange Lemma” ⋮ Adding matrix control: insertion-deletion systems with substitutions. III ⋮ On a hierarchy of languages generated by cooperating distributed grammar systems ⋮ Syntactic complexity of scattered context grammars ⋮ P Systems with Toxic Objects ⋮ When catalytic P systems with one catalyst can be computationally complete ⋮ Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete ⋮ On differentiation functions, structure functions, and related languages of context-free grammars ⋮ One-Sided Random Context Grammars: A Survey ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the generative capacity of matrix insertion-deletion systems of small sum-norm ⋮ Unnamed Item ⋮ Tissue P Systems with Vesicles of Multisets ⋮ CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages ⋮ On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 ⋮ Variants of P systems with activation and blocking of rules ⋮ Reaction automata ⋮ Different local controls for graph relabeling systems ⋮ Fundamental methodological issues of syntactic pattern recognition ⋮ An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules ⋮ A Pumping Lemma for Permitting Semi-Conditional Languages ⋮ An infinite hierarchy induced by depth synchronization ⋮ A note on uniformly limited ET0L systems with unique interpretation ⋮ Langford strings, formal languages and contextual ambiguity ⋮ On the interleaving semantics of transformation units — A step into GRACE ⋮ On the power of parallel communicating grammar systems with right-linear components ⋮ A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting ⋮ On the synchronized derivation depth of context-free grammars ⋮ Two collapsing hierarchies of subregularly tree controlled languages ⋮ Improved descriptional complexity results on generalized forbidding grammars ⋮ Deterministic Lindenmayer Systems with Dynamic Control of Parallelism ⋮ Generalized forbidding matrix grammars and their membrane computing perspective ⋮ On the universality of purely catalytic P systems ⋮ On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness ⋮ Even linear simple matrix languages: formal language properties and grammatical inference. ⋮ Fuzzy state grammar and fuzzy deep pushdown automaton
