scientific article; zbMATH DE number 3560777

MaRDI QIDQ4131691zbMATH OpenFDO

Authors Sheila A. Greibach

Publication date 1977

Full work available at URL https://eudml.org/doc/92046

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites work

• A note on semilinear sets and bounded-reversal multihead pushdown automata
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Erasable context-free languages
• scientific article; zbMATH DE number 3569843 (Why is no real title available?)
• scientific article; zbMATH DE number 3569860 (Why is no real title available?)
• On two-way multihead automata
• Remarks on the complexity of nondeterministic counter languages
• Time- and tape-bounded Turing acceptors and AFLs

This page was built for publication:

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