On the Complexity of Universality for Partially Ordered NFAs

Research output: Contribution to book/conference proceedings/anthology/reportConference contributionContributedpeer-review

Contributors

Details

Original languageEnglish
Title of host publication41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Pages61:1-61:14
Publication statusPublished - 2016
Peer-reviewedYes

Publication series

SeriesLeibniz international proceedings in informatics : LIPIcs
Volume58
ISSN1868-8969

External IDs

Scopus 85012918245