Stefan Hoffmann. State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs. Int. J. Found. Comput. Sci., 34(8):959-986, December 2023. [doi]
@article{Hoffmann23a-0,
title = {State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs},
author = {Stefan Hoffmann},
year = {2023},
month = {December},
doi = {10.1142/S0129054123430025},
url = {https://doi.org/10.1142/S0129054123430025},
researchr = {https://researchr.org/publication/Hoffmann23a-0},
cites = {0},
citedby = {0},
journal = {Int. J. Found. Comput. Sci.},
volume = {34},
number = {8},
pages = {959-986},
}