Path Systems: Constructions, Solutions and Applications

DOI10.1137/0209029MaRDI QIDQ3893308zbMATH OpenOpenAlexFDO

Authors Eitan M. Gurari, Oscar H. Ibarra

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

alternating Turing machineauxiliary pushdown automatonauxiliary stack automatonparallel Turing machinepath systemsrecursive Turing machineresource-bounded computationrestricted nondeterminismTuring machine

Mathematics Subject Classification ID

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

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893308)