Corrigendum to ``An optimal lower bound for nonregular languages

DOI10.1016/0020-0190(94)90018-3zbMath0834.68062OpenAlexW18030389MaRDI QIDQ1342265

Carlo Mereghetti, Alberto Bertoni, Giovanni Pighizzini

Publication date: 18 March 1996

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90018-3

zbMATH Keywords

computational complexitylower boundTuring machineformal languagesmodel complexity

Mathematics Subject Classification ID

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

Related Items (1)

TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES

This page was built for publication: Corrigendum to ``An optimal lower bound for nonregular languages