Path Systems: Constructions, Solutions and Applications

DOI10.1137/0209029zbMath0447.68049OpenAlexW1979934340MaRDI QIDQ3893308

Oscar H. Ibarra, Eitan M. Gurari

Publication date: 1980

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0209029

zbMATH Keywords

Turing machinerestricted nondeterminismalternating Turing machinepath systemsresource-bounded computationauxiliary pushdown automatonauxiliary stack automatonparallel Turing machinerecursive Turing machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of computing (68Q99)

Related Items (4)

Tree-size bounded alternation ⋮ Time complexity of unambiguous path systems ⋮ The complexity of ranking simple languages ⋮ (Semi)alternating stack automata

This page was built for publication: Path Systems: Constructions, Solutions and Applications