scientific article; zbMATH DE number 3648125

MaRDI QIDQ3206318zbMATH OpenFDO

Authors Jonathan Goldstine

Publication date 1977

zbMATH Keywords

context-free languagespushdown automataabstract family of languagesdata storagenondeterministic automatahardest languagesregular set of computation sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(7)

• On coordinated selective substitutions: Towards a unified theory of grammars and machines
• Rediscovering pushdown machines
• Pumping and pushdown machines
• Rational weighted tree languages with storage
• Iterated stack automata and complexity classes
• Extended macro grammars and stack controlled machines
• A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage

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 Q3206318)