scientific article; zbMATH DE number 4213435

zbMATH Open0733.68024MaRDI QIDQ3359751FDOQ3359751

Authors: Wolfgang Golubski, Wolfram-M. Lippe 

Publication date: 1990

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

Recommendations

• Tree-stack automata
• scientific article; zbMATH DE number 3885333
• Tree pushdown automata
• Tree Automata with Memory, Visibility and Structural Constraints
• Deciding emptiness for stack automata on infinite trees

zbMATH Keywords

stack automatastack languagescompiler theoryExtended Basic grammarsimplementation of recursive procedures with parameters

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cited In (12)

• Branching Pushdown Tree Automata
• Nested Sibling Tree Automata
• Title not available (Why is that?)
• Tree Automata with Memory, Visibility and Structural Constraints
• Deterministic stack transducers
• Iterated stack automata and complexity classes
• Visit-bounded stack automata
• Visit-bounded stack automata
• Deterministic stack transducers
• Tree pushdown automata
• Symbolic tree automata
• Rigid Tree Automata

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