Strict Local Testability with Consensus Equals Regularity

DOI10.1007/978-3-642-31606-7_10zbMath1297.68118OpenAlexW35469753MaRDI QIDQ2914699

Pierluigi San Pietro, Stefano Crespi Reghizzi

Publication date: 20 September 2012

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_10

zbMATH Keywords

regular languageformal languagescontext-sensitivesliding-windowcounter machineconsensual languagelocal languagecontext-freehomomorphic characterizationMedvedev theoremnon-countingstrict local testability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Counter machines, Petri nets, and consensual computation

This page was built for publication: Strict Local Testability with Consensus Equals Regularity