Testing Simon's congruence

27 Apr 2018 Fleischer Lukas Kufleitner Manfred

Piecewise testable languages are a subclass of the regular languages. There are many equivalent ways of defining them; Simon's congruence $\sim_k$ is one of the most classical approaches... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • FORMAL LANGUAGES AND AUTOMATA THEORY