From Regular to Strictly Locally Testable Languages

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Relations of contextual grammars with strictly locally testable selection languages ⋮ Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars ⋮ Unnamed Item

This page was built for publication: From Regular to Strictly Locally Testable Languages