Old Web
English
Sign In
Acemap
>
Paper
>
Bounded Reachability Problems Are Decidable in FIFO Machines.
Bounded Reachability Problems Are Decidable in FIFO Machines.
2020
Benedikt Bollig
Alain Finkel
Amrita Suresh
Keywords:
Bounded function
Reachability
FIFO (computing and electronics)
Discrete mathematics
Decidability
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]