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