scientific article; zbMATH DE number 3495606

MaRDI QIDQ4077463zbMATH OpenFDO

Authors A. N. Maslov

Publication date 1974

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recursively (computably) enumerable sets and degrees (03D25)

Cited in

(15)

• scientific article; zbMATH DE number 7243673 (Why is no real title available?)
• Epsilon-reducible context-free languages and characterizations of indexed languages
• General decidability results for asynchronous shared-memory programs: higher-order and beyond
• Look-ahead on pushdowns
• The grammar of mammalian brain capacity
• Iterated pushdown automata and sequences of rational numbers
• The IO- and OI-hierarchies
• Weighted automata with storage
• An application of iterative pushdown automata to contour words of balls and truncated balls in hyperbolic tessellations
• Iterated stack automata and complexity classes
• Word-mappings of level 2
• Parameter-reduction of higher level grammars
• Local higher-order fixpoint iteration
• General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
• scientific article; zbMATH DE number 7455743 (Why is no real title available?)

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