Time complexity of unambiguous path systems
type: Item
instance of: scholarly article
title: Time complexity of unambiguous path systems
zbMATH Open document ID: 0496.68034
DOI: 10.1016/0020-0190(82)90039-4
author: Wojciech Rytter
published in: Information Processing Letters
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3782386
zbMATH Keywords: deterministic two-way pushdown automata
zbMATH Keywords: unambiguous context-free languages
zbMATH Keywords: bottom-up simulation
zbMATH Keywords: linear time algorithms
MaRDI profile type: Publication
full work available at URL: 0020-0190(82)90039-4
OpenAlex ID: W2027383620
cites work: Path Systems: Constructions, Solutions and Applications
description: scientific article; zbMATH DE number 3782386