M. Thomazo

activity

20132026

most citedComplexity of Universality and Related Problems for Partially Ordered NFAs

25 citations · 47 across the 12 of their papers we have counts for

collaborators

Showing 2014 · cs.FLShow all

2 papers · 2 filters

cs.FL2014★ 2 cited

On $k$ -piecewise testability (preliminary report)

Tomáš Masopust, Michaël Thomazo

For a non-negative integer $k$ , a language is $k$ -piecewise test\-able ( $k$ -PT) if it is a finite boolean combination of languages of the form $Σ^{*} a_{1} Σ^{*} \dots Σ^{*} a_{n} Σ^{*}$ for…

cs.FL2014★ 6 cited

Alternating Towers and Piecewise Testable Separators

Štěpán Holub, Tomáš Masopust, Michaël Thomazo

Two languages are separable by a piecewise testable language if and only if there exists no infinite tower between them. An infinite tower is an infinite sequence of strings altern…

On k-piecewise testability (preliminary report)

Alternating Towers and Piecewise Testable Separators

On $k$ -piecewise testability (preliminary report)