Mappings which preserve context sensitive languages

DOI10.1016/S0019-9958(66)80016-5zbMath0145.00803MaRDI QIDQ5521477

Sheila A. Greibach, Seymour Ginsburg

Publication date: 1966

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

zbMATH Keywords

mathematical logic

Related Items (20)

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

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