scientific article; zbMATH DE number 3560777

zbMath0359.68090MaRDI QIDQ4131691

Sheila A. Greibach

Publication date: 1977

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A note on semilinear sets and bounded-reversal multihead pushdown automata
• Remarks on the complexity of nondeterministic counter languages
• Time- and tape-bounded Turing acceptors and AFLs
• On two-way multihead automata
• Erasable context-free languages
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

This page was built for publication: