Grammars with partial ordering of the rules

DOI10.1016/S0019-9958(68)90439-7MaRDI QIDQ5560286zbMATH OpenOpenAlexFDO

Authors Ivan Friš

Publication date 1968

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(68)90439-7

zbMATH Keywords

languages, automata, networks

Cited in

(18)

• A variant of random context grammars: Semi-conditional grammars
• Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages
• ETOL-grammars and N-grammars
• Computing with graph rewriting systems with priorities
• On the descriptional complexity of some rewriting mechanisms regulated by context conditions
• Dynamically controlled cooperating/distributed grammar systems
• Theory of formal grammars
• A hierarchy between context-free and context-sensitive languages
• scientific article; zbMATH DE number 3657147 (Why is no real title available?)
• Size, index, and context-sensitivity of controlled partition grammars
• On grammars with local and global context conditions
• scientific article; zbMATH DE number 3436633 (Why is no real title available?)
• Accepting grammars with regulation
• Lindenmayer systems with control by ideals and codes
• A pumping lemma for permitting semi-conditional languages
• scientific article; zbMATH DE number 3330750 (Why is no real title available?)
• Controlled hybrid CD grammar systems
• Priorities on context conditions in rewriting systems

This page was built for publication: Grammars with partial ordering of the rules

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