On complexity of grammars related to the safety problem
From MaRDI portal
Publication:2465626
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3936518 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- A Linear Time Algorithm for Deciding Subject Security
- CONCUR 2005 – Concurrency Theory
- Fundamentals of Computation Theory
- Leftist grammars and the Chomsky hierarchy
- On the decidability of accessibility problems (extended abstract)
- Protection in operating systems
- Safety in grammatical protection systems
Cited in
(8)- Automata, Languages and Programming
- Toward a compositional theory of leftist grammars and transformations
- Safety in grammatical protection systems
- Leftist grammars and the Chomsky hierarchy
- Fundamentals of Computation Theory
- On Complexity of Grammars Related to the Safety Problem
- On the decidability of accessibility problems (extended abstract)
- Leftist Grammars Are Non-primitive Recursive
This page was built for publication: On complexity of grammars related to the safety problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465626)