"Reachability and Bounded Emptiness Problems of Constraint Automata with ..."

Jakub Michaliszyn, Jan Otop, Piotr Wieczorek (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CONCUR.2023.3

access: open

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/concur/MichaliszynOW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/concur/MichaliszynOW23
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix. CONCUR 2023: 3:1-3:16

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.