Back to Search
Start Over
On Complexity of Grammars Related to the Safety Problem.
- Source :
- Automata, Languages & Programming (9783540359074); 2006, p432-443, 12p
- Publication Year :
- 2006
-
Abstract
- Leftist grammars were introduced by Motwani et. al., who established the relationship between the complexity of accessibility problem (or safety problem) for certain general protection system and the membership problem of these grammars. The membership problem for leftist grammars is decidable. This implies the decidability of the accessibility problem. It is shown that the membership problem for leftist grammars is PSPACE-hard. Therefore, the accessibility problem in the appropriate protection systems is PSPACE-hard as well. Furthermore, the PSPACE-hardness result is adopted to very restricted class of leftist grammars, if the grammar is a part of the input. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540359074
- Database :
- Supplemental Index
- Journal :
- Automata, Languages & Programming (9783540359074)
- Publication Type :
- Book
- Accession number :
- 32689359
- Full Text :
- https://doi.org/10.1007/11787006_37