Automata, Languages and Programming
From MaRDI portal
Publication:5716750
DOI10.1007/11523468zbMath1081.68674OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716750
No author found.
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Related Items (2)
Approximate string matching using a bidirectional index ⋮ Graph connectivity, partial words, and a theorem of Fine and Wilf
This page was built for publication: Automata, Languages and Programming