Degrees of non-monotonicity for restarting automata
type: Item
instance of: scholarly article
title: Degrees of non-monotonicity for restarting automata
zbMATH Open document ID: 1142.68423
author: Tomasz Jurdziński
author: František Mráz
author: Friedrich Otto
author: Martin Plátek
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5083773
zbMATH Keywords: restarting automata
zbMATH Keywords: monotonicity
zbMATH Keywords: degree of monotonicity
describes a project that uses: UCFL
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.08.029
OpenAlex ID: W1971514060
cites work: Q5536271
cites work: Q4284250
cites work: Restarting automata
cites work: Q4934755
cites work: Q4737153
cites work: Q5716611
cites work: Developments in Language Theory
cites work: Q3022298
cites work: Q5588662
cites work: Church-Rosser Thue systems and formal languages
cites work: Hierarchies of weakly monotone restarting automata
cites work: Q3839075
cites work: Restarting automata, Church-Rosser languages, and representations of {r. e. \ }languages
cites work: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
cites work: Q4452052
cites work: Q4474000
DOI: 10.1016/J.TCS.2006.08.029
Recommended article: Q3517257
Recommended article: On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone
Recommended article: Sequential monotonicity for restarting automata
Recommended article: Q5053759
Recommended article: A hierarchy of monotone deterministic non-forgetting restarting automata
Recommended article: Q3517104
Recommended article: Q4934755
Recommended article: Developments in Language Theory
Recommended article: On the complexity of 2-monotone restarting automata
description: scientific article; zbMATH DE number 5083773