Reachability in Pushdown Register Automata
From MaRDI portal
Publication:2922039
DOI10.1007/978-3-662-44522-8_39zbMath1425.68221OpenAlexW3021321801MaRDI QIDQ2922039
S. J. Ramsay, Nikos Tzevelekos, Andrzej S. Murawski
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/86773/7/WRAP-reachability-pushdown-register-automata-Murawski-2017.pdf
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
A taxonomy and reductions for common register automata formalisms ⋮ Regular and context-free nominal traces
This page was built for publication: Reachability in Pushdown Register Automata