Jumping scattered context grammars

DOI10.3233/FI-2017-1512MaRDI QIDQ4595586zbMATH OpenOpenAlexFDO

Authors Alexander Meduna, Ondřej Soukup

Publication date 5 December 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2017-1512

zbMATH Keywords

computational completenessscattered context grammarsgenerative powerjumping derivation modes

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Jumping grammars
• On the descriptional complexity of scattered context grammars
• Scattered context grammars with one non-context-free production are computationally complete
• Scattered versus context-sensitive rewriting
• Generative power of three-nonterminal scattered context grammars

Cited in

(3)

• Jumping grammars
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
• On double-jumping finite automata and their closure properties

This page was built for publication: Jumping scattered context grammars

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