Time complexity of unambiguous path systems

DOI10.1016/0020-0190(82)90039-4zbMath0496.68034OpenAlexW2027383620MaRDI QIDQ1170033

Wojciech Rytter

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90039-4

zbMATH Keywords

linear time algorithmsbottom-up simulationdeterministic two-way pushdown automataunambiguous context-free languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (2)

Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition ⋮ On the parallel recognition of unambiguous context-free languages

Cites Work

• Path Systems: Constructions, Solutions and Applications

This page was built for publication: Time complexity of unambiguous path systems