Invisible pushdown languages

Speaker(s)

Eryk Kopczyński

Affiliation

Uniwersytet Warszawski

Date

Dec. 16, 2015, 2:15 p.m.

Room

room 5870

Seminar

Seminar Automata Theory

---

Context free languages allow one to express data with hierarchical structure, at the cost of losing some of the useful properties of languages recognized by finite automata on words. However, it is possible to restore some of these properties by making the structure of the tree visible, such as is done by visibly pushdown languages, or finite automata on trees. In this paper, we show that the structure given by such approaches remains invisible when it is read by a finite automaton (on word). In particular, we show that separability with a regular language is undecidable for visibly pushdown languages, just as it is undecidable for general context free languages.

---