"On the Complexity of Universality for Partially Ordered NFAs."

Markus Krötzsch, Tomás Masopust, Michaël Thomazo (2016)

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2016.61

access: open

type: Conference or Workshop Paper

metadata version: 2021-10-14

a service of  Schloss Dagstuhl - Leibniz Center for Informatics