Jumping grammars

DOI10.1142/S0129054115500409MaRDI QIDQ3455751zbMATH OpenOpenAlexFDO

Authors Zbyněk Křivka, Alexander Meduna

Publication date 11 December 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054115500409

zbMATH Keywords

discontinuous rewritingfinite indexgenerative powerjumping finite automatamodified grammarssemilinearity

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Jumping scattered context grammars
• Jumping finite automata: characterizations and complexity
• Characterization and complexity results on jumping finite automata
• On double-jumping finite automata and their closure properties
• Jumping finite automata

Cites work

• Jumping finite automata
• On certain formal properties of grammars

Cited in

(7)

• Enhancement of automata with jumping modes
• Characterization and complexity results on jumping finite automata
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
• Jumping scattered context grammars
• On double-jumping finite automata and their closure properties
• Regular and linear permutation languages
• The effect of jumping modes on various automata models

This page was built for publication: Jumping grammars

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