Decidability of operation problems for T0L languages and subclasses
type: Item
instance of: scholarly article
title: Decidability of operation problems for T0L languages and subclasses
zbMATH Open document ID: 1217.68124
author: Henning Bordihn
author: Markus Holzer
author: Martin Kutrib
published in: Information and Computation
publication date: 2011-07-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5932318
zbMATH Keywords: L systems
zbMATH Keywords: operation problem
zbMATH Keywords: decidability
zbMATH Keywords: unary languages
MaRDI profile type: Publication
full work available at URL: j.ic.2010.11.008
OpenAlex ID: W1998380256
cites work: Q3292904
cites work: UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
cites work: On the union of 0L languages
cites work: Characterization of unary developmental languages
cites work: Q5592246
cites work: Pure grammars
cites work: A variant of a recursively unsolvable problem
cites work: Q4140407
cites work: Q5678435
cites work: Solution of a decision problem concerning unary Lindenmayer systems
DOI: 10.1016/J.IC.2010.11.008
description: scientific article; zbMATH DE number 5932318