On complexity of grammars related to the safety problem
From MaRDI portal
Publication:2465626
DOI10.1016/J.TCS.2007.07.043zbMATH Open1143.68028OpenAlexW2129677902MaRDI QIDQ2465626FDOQ2465626
Authors: Tomasz Jurdziński 
Publication date: 7 January 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.043
Recommendations
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Grammars and rewriting systems (68Q42)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Protection in operating systems
- Title not available (Why is that?)
- A Linear Time Algorithm for Deciding Subject Security
- Safety in grammatical protection systems
- On the decidability of accessibility problems (extended abstract)
- Leftist grammars and the Chomsky hierarchy
- Fundamentals of Computation Theory
- CONCUR 2005 – Concurrency Theory
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)
