Leftist grammars are non-primitive recursive

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 51-62

  Jurdziński, Tomasz ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; ELECTRIC BREAKDOWN; ELECTRIC POWER SYSTEM PROTECTION; RECURSIVE FUNCTIONS; TRANSLATION (LANGUAGES);

LEFTIST GRAMMARS; MEMBERSHIP PROBLEMS; PROTECTION SYSTEMS;

LINGUISTICS;

EID: 49049099019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_5     Document Type: Conference Paper

References (10)

1. Bandyopadhyay, S., Mahajan, M., Narayan Kumar, K.: A non-regular leftist language (manuscript, 2005)
2. Cheiner, O., Saraswat, V.: Security Analysis of Matrix. Technical report, AT&T Shannon Laboratory (1999)
3. Harrison, M., Ruzzo, W., Ullman, J.: Protection in operating systems. Communications of the ACM 19(8), 461-470 (1976)
4. Jurdziński, T.: On Complexity of Grammars Related to the Safety Problem. Theoretical Computer Science 389(1-2), 56-72 (2007); An extended abstract appeared in ICALP 2006 Proceedings
5. Jurdziński, T.: Leftist Grammars are Non-primitive Recursive, Technical Report of the Institute of Computer Science, University of Wroclaw (2008/01)
6. Jurdziński, T., Loryś, K.: Leftist Grammars and the Chomsky Hierarchy. Theory of Computing Systems 41(2), 233-256 (2007)
7. Motwani, R., Panigrahy, R., Saraswat, V.A., Venkatasubramanian, S.: In: STOC 2000, pp. 306-315 (2000)
8. Saraswat, V.: The Matrix Design. Technical report, AT&T Laboratory (April 1997)
9. Saraswat, V., Jagadeesan, R.: Static support for capability-based programming in Java (manuscript)
10. Schnoebelen, P.: Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity. Information Processing Letters 83(5), 251-261 (2002)