A Note on the Complexity of General D0L Membership

DOI10.1137/0210009MaRDI QIDQ3902531zbMATH OpenOpenAlexFDO

Authors Neil D. Jones, Sven Skyum

Publication date 1981

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

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

zbMATH Keywords

DOL system

Mathematics Subject Classification ID

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

Cited in

(2)

• The Euclidean traveling salesman problem and a space-filling curve
• Parallel complexity of iterated morphisms and the arithmetic of small numbers

This page was built for publication: A Note on the Complexity of General $D0L$ Membership

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