A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES

DOI10.1142/S0129054195000123zbMath0830.68090MaRDI QIDQ4853336

S. Purushothaman Iyer, Wuxu Peng

Publication date: 29 October 1995

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

zbMATH Keywords

pushdown automatainfinite treescontext-free tree grammarsmodal- checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Model checking probabilistic systems against pushdown specifications

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