A hierarchy of monotone deterministic non-forgetting restarting automata
type: Item
instance of: scholarly article
title: A hierarchy of monotone deterministic non-forgetting restarting automata
zbMATH Open document ID: 1209.68303
author: Hartmut Messerschmidt
author: Friedrich Otto
published in: Theory of Computing Systems
publication date: 2011-03-30T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 5871615
zbMATH Keywords: restarting automata
zbMATH Keywords: nonforgetting
zbMATH Keywords: hierarchy of language classes
zbMATH Keywords: RRWW-model
MaRDI profile type: Publication
full work available at URL: s00224-009-9247-x
OpenAlex ID: W2146469177
cites work: Growing context-sensitive languages and Church-Rosser languages
cites work: LR-regular grammars - an extension of LR(k) grammars
cites work: Membership for growing context-sensitive grammars is polynomial
cites work: Q4934755
cites work: Restarting automata with restricted utilization of auxiliary symbols
cites work: SHRINKING RESTARTING AUTOMATA
cites work: Developments in Language Theory
cites work: Degrees of non-monotonicity for restarting automata
cites work: Church-Rosser Thue systems and formal languages
cites work: On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone
cites work: COOPERATING DISTRIBUTED SYSTEMS OF RESTARTING AUTOMATA
cites work: ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
cites work: The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete
cites work: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
cites work: Q4452052
cites work: Left-to-right regular languages and two-way restarting automata
cites work: Q4474000
DOI: 10.1007/S00224-009-9247-X
description: scientific article; zbMATH DE number 5871615