scientific article; zbMATH DE number 3658994

MaRDI QIDQ3857722zbMATH OpenFDO

Authors

Publication date 1979

zbMATH Keywords

complexitytree transducerstwo-way automatatwo-way pushdown automatamacro grammarstransition tablesgsm mappingschecking automatagrammars for two-way transducersregister grammarstwo-way finite state transducerstwo-way read-only tape

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45)

Cited in

(10)

• The power of two-way deterministic checking stack automata
• The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
• A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
• Query automata over finite trees
• Pushdown machines for the macro tree transducer
• The IO- and OI-hierarchies
• Rational weighted tree languages with storage
• Principal abstract families of weighted tree languages
• Three hierarchies of transducers
• Outils et résultats pour les transducteurs boustrophédons

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