Single semi-contextual insertion-deletion systems
In this paper we consider the model of single insertion-deletion systems that at each step
insert or delete a single symbol in a context-free manner (ie at any position in the word). The …
insert or delete a single symbol in a context-free manner (ie at any position in the word). The …
On the power of generalized forbidding insertion-deletion systems
We consider generalized forbidding insertion-deletion systems (GFID) where each insertion-
deletion rule is associated with a set F of words and the rule can be applied to a string only if …
deletion rule is associated with a set F of words and the rule can be applied to a string only if …
Parsimonious computational completeness
H Fernau - Developments in Language Theory: 25th International …, 2021 - Springer
Parsimonious Computational Completeness | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …