On representing recursively enumerable languages by internal contextual languages
type: Item
instance of: scholarly article
title: On representing recursively enumerable languages by internal contextual languages
zbMATH Open document ID: 0913.68117
DOI: 10.1016/S0304-3975(97)00035-2
author: Andrzej Ehrenfeucht
author: Gheorghe Păun
author: Grzegorz Rozenberg
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1238798
zbMATH Keywords: internal contextual languages
MaRDI profile type: Publication
cites work: Reversal-bounded multipushdown machines
cites work: The linear landscape of external contextual languages
cites work: Scattered versus context-sensitive rewriting
cites work: Q4198075
cites work: Q4162676
cites work: The family of one-counter languages is closed under quotient
cites work: On characterizations of recursively enumerable languages
cites work: Algebraic linguistics; analytical models
cites work: Q5588662
cites work: Q3680292
cites work: Q4005180
cites work: Q4289280
cites work: Q3899531
cites work: Q4874661
cites work: Programmed Grammars and Classes of Formal Languages
cites work: Q5621109
cites work: Q5678435
cites work: Q4146264
cites work: Q4005268
full work available at URL: s0304-3975(97)00035-2
OpenAlex ID: W2089548442
description: scientific article; zbMATH DE number 1238798