Reachability analysis of reversal-bounded automata on series–parallel graphs
Crossref DOI link: https://doi.org/10.1007/s00236-016-0290-1
Published Online: 2016-12-18
Published Print: 2018-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Dimitrova, Rayna
Majumdar, Rupak
Funding for this research was provided by:
Max Planck Institute for Software Systems
License valid from 2016-12-18