The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete).
Laure DaviaudDavid PurserPublished in: LICS (2023)
Keyphrases
- pspace complete
- exptime complete
- tree automata
- model checking
- np complete
- finite state
- automata theoretic
- temporal logic
- satisfiability problem
- regular expressions
- finite automata
- decision problems
- strips planning
- plan existence
- data complexity
- cellular automata
- context free
- description logics
- datalog programs
- np hard
- coalition logic
- pattern matching
- data exchange
- context free grammars
- conjunctive queries
- query answering