Contextual insertions/deletions and computability
type: Item
instance of: scholarly article
title: Contextual insertions/deletions and computability
zbMATH Open document ID: 0872.68038
author: Lila Kari
author: Gabriel Thierrin
published in: Information and Computation
publication date: 1997-10-13T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 987868
zbMATH Keywords: Turing machine
zbMATH Keywords: contextual insertions
zbMATH Keywords: deletions
MaRDI profile type: Publication
full work available at URL: inco.1996.0091
OpenAlex ID: W2075622371
DOI: 10.1006/INCO.1996.0091
Recommended article: Computational completeness of simple semi-conditional insertion-deletion systems
Recommended article: Context-free insertion-deletion systems
Recommended article: Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems
Recommended article: On the computational power of insertion-deletion systems
Recommended article: Q4414687
Recommended article: Q6070610
Recommended article: Random context and semi-conditional insertion-deletion systems
Recommended article: Insertion and deletion closure of languages
Recommended article: Decidability Questions for Insertion Systems and Related Models
Recommended article: Q3517111
description: scientific article; zbMATH DE number 987868