A generator of context-sensitive languages

DOI10.1016/S0022-0000(69)80032-2MaRDI QIDQ2542287zbMATH OpenFDO

Authors Ben Wegbreit

Publication date 1969

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

Full work available at URL https://doi.org/10.1016/S0022-0000(69)80032-2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

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

Cited in

(11)

• Bounded query machines: on NP( ) and NPQUERY( )
• 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
• Complete symmetry in d2l systems and cellular automata
• scientific article; zbMATH DE number 3673546 (Why is no real title available?)
• On the structure of context-sensitive grammars

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

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