On the decidability of accessibility problems (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Protection in operating systems
Communications of the ACM
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Leftist Grammars and the Chomsky Hierarchy
Theory of Computing Systems
On complexity of grammars related to the safety problem
Theoretical Computer Science
Pumping and counting on the regular post embedding problem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Computing blocker sets for the regular post embedding problem
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Toward a compositional theory of leftist grammars and transformations
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Rational subsets and submonoids of wreath products
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
Leftist grammars were introduced by Motwani et. al. [7], as a tool to show decidability of the accessibility problem in certain general protection systems. It is shown that the membership problem for languages defined by leftist grammars is non-primitive recursive. Therefore, by the reduction of Motwani et. al., the accessibility problem in the appropriate protection systems is non-primitive recursive as well.