On Separation by Locally Testable and Locally Threshold Testable Languages

DOI10.2168/LMCS-10(3:24)2014zbMath1341.68108arXiv1308.0181MaRDI QIDQ2921121

Thomas Place, Lorijn van Rooijen, Marc Zeitoun

Publication date: 30 September 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.0181

zbMATH Keywords

automatalogicscontext-free languagemonoidsseparationlocally testablelocally threshold testable

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (8)

Pointlike sets and separation: a personal perspective ⋮ Minimal consistent DFA revisited ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT ⋮ Subsequence versus substring constraints in sequence pattern languages ⋮ Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games ⋮ Unnamed Item

This page was built for publication: On Separation by Locally Testable and Locally Threshold Testable Languages