Login / Signup
Bounded Reachability Problems are Decidable in FIFO Machines.
Benedikt Bollig
Alain Finkel
Amrita Suresh
Published in:
CoRR (2021)
Keyphrases
</>
solving problems
real world
application domains
problems involving
databases
information retrieval
search algorithm
state space
expressive power
transitive closure
polynomial hierarchy