scientific article; zbMATH DE number 6851900

DOI10.4230/LIPIcs.MFCS.2016.67zbMath1398.68323arXiv1603.00361MaRDI QIDQ4608630

Tomáš Masopust

Publication date: 21 March 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

automatalogicsnondeterminismlanguages\(k\)-piecewise testability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (8)

On Boolean combinations forming piecewise testable languages ⋮ Unnamed Item ⋮ Alternating complexity of counting first-order logic for the subword order ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ On shuffle products, acyclic automata and piecewise-testable languages ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: