Inductive definability in formal language theory

DOI10.1016/0022-0000(78)90025-9MaRDI QIDQ1245578zbMATH OpenOpenAlexFDO

Authors P. F. Schuler

Publication date 1978

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(78)90025-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A note on degrees of context-sensitivity
• Abstract Computability and Invariant Definability
• Generalized recursion theory. Proceedings of the 1972 Oslo symposium
• scientific article; zbMATH DE number 3216177 (Why is no real title available?)
• Semantics of context-free languages
• Semirecursive Sets and Positive Reducibility
• WCS-analysis of the context-sensitive
• Weakly-context-sensitive languages as model for programming-languages

This page was built for publication: Inductive definability in formal language theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245578)