Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages

DOI10.1016/0304-3975(82)90073-1zbMath0477.68089OpenAlexW2073712736MaRDI QIDQ1160495

Sorin Istrail

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90073-1

zbMATH Keywords

regular expressionsrecursively enumerable languagescontext sensitive languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Uses Software

• ALGOL 60

Cites Work

• Two Families of Languages Related to ALGOL
• On context-free languages and push-down automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages