State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs.

MLA

Hoffmann, Stefan. “State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs.” International Journal of Foundations of Computer Science, vol. 34, no. 8, Dec. 2023, pp. 959–86. EBSCOhost, https://doi.org/10.1142/S0129054123430025.

APA

Hoffmann, S. (2023). State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs. International Journal of Foundations of Computer Science, 34(8), 959–986. https://doi.org/10.1142/S0129054123430025

Chicago

Hoffmann, Stefan. 2023. “State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs.” International Journal of Foundations of Computer Science 34 (8): 959–86. doi:10.1142/S0129054123430025.