On the Complexity of Universality for Partially Ordered NFAs

DOI10.4230/LIPIcs.MFCS.2016.62zbMath1398.05176OpenAlexW2534391846MaRDI QIDQ4608625

Gal Vardi, Orna Kupferman

Publication date: 21 March 2018

Full work available at URL: https://inria.hal.science/hal-01334958

zbMATH Keywords

regular languagesEulerian paths

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: On the Complexity of Universality for Partially Ordered NFAs