scientific article; zbMATH DE number 3560777

zbMATH Open0359.68090MaRDI QIDQ4131691FDOQ4131691

Authors: Sheila A. Greibach 

Publication date: 1977

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cites Work

• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Remarks on the complexity of nondeterministic counter languages
• A note on semilinear sets and bounded-reversal multihead pushdown automata
• Erasable context-free languages
• On two-way multihead automata
• Title not available (Why is that?)
• Time- and tape-bounded Turing acceptors and AFLs
• Title not available (Why is that?)

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)