Mappings which preserve context sensitive languages

DOI10.1016/S0019-9958(66)80016-5MaRDI QIDQ5521477zbMATH OpenFDO

Authors Seymour Ginsburg, Sheila A. Greibach

Publication date 1966

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(66)80016-5

zbMATH Keywords

mathematical logic

Cited in

(20)

• Control sets on context-free grammar forms
• Match-bounded string rewriting systems
• On the degrees of non-regularity and non-context-freeness
• A hierarchy between context-free and context-sensitive languages
• Error detection in formal languages
• Time-bounded grammars and their languages
• DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
• Deterministic Pushdown Automata and Unary Languages
• On reducing the number of states in a PDA
• INDUCTIVE COMPOSITION OF NUMBERS WITH MAXIMUM, MINIMUM, AND ADDITION: A New Theory for Program Execution-Time Analysis
• Control sets on grammars
• The theory of languages
• The theory of languages
• A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free
• scientific article; zbMATH DE number 3330750 (Why is no real title available?)
• Images of AFL under certain families of homomorphisms
• On the structure of context-sensitive grammars
• On the Degree of Extension of Some Models Defining Non-Regular Languages
• Deleting string rewriting systems preserve regularity
• Termination proofs for string rewriting systems via inverse match-bounds

This page was built for publication: Mappings which preserve context sensitive languages

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