Automata, Languages and Programming
From MaRDI portal
Publication:5466484
DOI10.1007/b99859zbMath1099.03512OpenAlexW2505584480MaRDI QIDQ5466484
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)
This page was built for publication: Automata, Languages and Programming
