From Regular to Strictly Locally Testable Languages
From MaRDI portal
Publication:2789519
DOI10.4204/EPTCS.63.14zbMath1331.68125arXiv1108.3626MaRDI QIDQ2789519
Pierluigi San Pietro, Stefano Crespi Reghizzi
Publication date: 1 March 2016
Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.3626
68Q45: Formal languages and automata
Related Items
Unnamed Item, Relations of contextual grammars with strictly locally testable selection languages, Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars