Abstract
Multi-pebble automata are considered, appropriately restricted to accept only regular languages, and enriched with additional features, such as nondeterminism and concurrency. We investigate the succinctness of such machines, and the extent to which this succinctness carries over to make the reasoning problem in propositional dynamic logic (PDL) more difficult. The two main results establish that each additional pebble provides inherent exponential power on both fronts.
Cite
CITATION STYLE
Globerman, N., & Harel, D. (1994). Complexity results for multi-pebble automata and their logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 820 LNCS, pp. 73–82). Springer Verlag. https://doi.org/10.1007/3-540-58201-0_59
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
