A generator of context-sensitive languages

DOI10.1016/S0022-0000(69)80032-2zbMath0205.31302MaRDI QIDQ2542287

Ben Wegbreit

Publication date: 1969

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

Unnamed Item ⋮ Bounded query machines: on NP( ) and NPQUERY( ) ⋮ On the structure of context-sensitive grammars ⋮ Complete symmetry in d2l systems and cellular automata ⋮ Abstract families of length-preserving processors ⋮ Comparing complexity classes ⋮ Remarks on the complexity of nondeterministic counter languages ⋮ A note on classes of complements and the LBA-problem ⋮ On the existence of generators for certain AFL ⋮ Time- and tape-bounded Turing acceptors and AFLs ⋮ Tape-bounded Turing acceptors and principal AFLs

Cites Work

• Classes of languages and linear-bounded automata
• Three theorems on phrase structure grammars of type 1

This page was built for publication: A generator of context-sensitive languages