A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES

DOI10.1142/S0129054195000123zbMATH Open0830.68090MaRDI QIDQ4853336FDOQ4853336

Authors: Wuxu Peng, S. Purushothaman Iyer 

Publication date: 29 October 1995

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
• Reachability analysis of pushdown automata: Application to model-checking
• Branching Pushdown Tree Automata
• scientific article; zbMATH DE number 1980931
• scientific article; zbMATH DE number 1232241

zbMATH Keywords

pushdown automatainfinite treescontext-free tree grammarsmodal- checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (3)

• Model checking probabilistic systems against pushdown specifications
• PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
• Title not available (Why is that?)

This page was built for publication: A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4853336)