A P-complete language describable with iterated shuffle
type: Item
instance of: scholarly article
title: A P-complete language describable with iterated shuffle
zbMATH Open document ID: 0780.68087
DOI: 10.1016/0020-0190(92)90165-R
author: Takayoshi Shoudai
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 92056
zbMATH Keywords: computational complexity
zbMATH Keywords: formal language
zbMATH Keywords: \(P\)-complete language
MaRDI profile type: Publication
cites work: Flow languages equal recursively enumerable languages
cites work: The power of synchronizing operations on strings
cites work: Extending regular expressions with iterated shuffle
cites work: On the enlargement of the class of regular languages by the shuffle closure
cites work: Software Descriptions with Flow Expressions
cites work: On the complexity of iterated shuffle
full work available at URL: 0020-0190(92)90165-r
OpenAlex ID: W1989896950
description: scientific article; zbMATH DE number 92056