The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete).
Laure DaviaudDavid PurserPublished in: CoRR (2023)
Keyphrases
- pspace complete
- exptime complete
- tree automata
- np complete
- model checking
- regular expressions
- satisfiability problem
- finite state
- finite automata
- decision problems
- strips planning
- plan existence
- cellular automata
- causal graph
- automata theoretic
- description logics
- context free
- reasoning tasks
- context free grammars
- data complexity
- phase transition
- temporal logic