Complexity results for two-way and multi-pebble automata and their logics
- 1 December 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 169 (2) , 161-184
- https://doi.org/10.1016/s0304-3975(96)00119-3
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Using graphs to understand PDLPublished by Springer Nature ,2005
- On the power of bounded concurrency IJournal of the ACM, 1994
- State-complexity of finite-state devices, state compressibility and incompressibilityTheory of Computing Systems, 1993
- Alternation with a pebbleInformation Processing Letters, 1991
- A thesis for bounded concurrencyPublished by Springer Nature ,1989
- Propositional dynamic logic of flowchartsInformation and Control, 1985
- Alternating Pushdown and Stack AutomataSIAM Journal on Computing, 1984
- AlternationJournal of the ACM, 1981
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- Complexity measures for regular expressionsJournal of Computer and System Sciences, 1976