Reachability Analysis of Reversal-bounded Automata on Series–parallel Graphs

Dimitrova, Rayna; Majumdar, Rupak

doi:10.1007/s00236-016-0290-1

Local TagsRelease HistoryDetailsSummary

Reachability Analysis of Reversal-bounded Automata on Series–parallel Graphs

Dimitrova, R., & Majumdar, R. (2018). Reachability Analysis of Reversal-bounded Automata on Series–parallel Graphs. Acta Informatica, 55(2), 153-189. doi:10.1007/s00236-016-0290-1.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-0003-1F7A-3 Version Permalink: https://hdl.handle.net/21.11116/0000-0003-1F7E-F

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Dimitrova, Rayna¹, Author
Majumdar, Rupak¹, Author

Affiliations:
1Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society, ou_2105292

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2016Date issued: 2018

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Dimitrova2018
DOI: 10.1007/s00236-016-0290-1

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Acta Informatica

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Heidelberg : Springer-Verlag Heidelberg

Pages: - Volume / Issue: 55 (2) Sequence Number: - Start / End Page: 153 - 189 Identifier: ISSN: 0001-5903
CoNE: https://pure.mpg.de/cone/journals/resource/954925373807