Branching Pushdown Tree Automata

Loading...
Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
CPS Theory
Computer Sciences
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Chaudhuri, Swarat
Contributor
Abstract

We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children of a tree node in possibly different control states but with identical stacks. We propose branching pushdown tree automata (BPTAs) as a solution. In a BPTA, a push-move views its matching pops as an unbounded, unordered set of successor moves and can assert existential and universal requirements on them, just the way finite automata on unranked, unordered trees pass requirements to the children of a tree node. We show that BPTAs can express some natural properties and are more expressive than PTAs. Using a small-model theorem, we prove their emptiness problem to be decidable. The problem becomes undecidable, however, if push-moves are allowed to specify the ordering of matching pops.

Advisor
Date of presentation
2006-12-01
Conference name
Departmental Papers (CIS)
Conference dates
2023-05-17T07:07:29.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
From the 26th International Conference, Kolkata, India, December 13-15, 2006.
Recommended citation
Collection