Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"State Complexity of Permutation and the Language Inclusion Problem up to ..."

Stefan Hoffmann (2023)

> Home

Details and statistics

DOI: 10.1142/S0129054123430025

access: closed

type: Journal Article

metadata version: 2024-03-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/Hoffmann23a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/Hoffmann23a
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 (2023)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.