Lab for Automated Reasoning and Analysis LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
visibly_pushdown_languages [2007/06/05 11:17]
vkuncak
visibly_pushdown_languages [2007/06/05 11:20] (current)
vkuncak
Line 52: Line 52:
 Thanks to closure properties. Thanks to closure properties.
  
-===== Strack ​trees =====+ 
 +===== Stack trees =====
  
 We can associate //​injectively//​ trees with words over pushdown alphabet, then visibly pushdown languages correspond to regular trees. We can associate //​injectively//​ trees with words over pushdown alphabet, then visibly pushdown languages correspond to regular trees.
 
visibly_pushdown_languages.txt · Last modified: 2007/06/05 11:20 by vkuncak
 
© EPFL 2018 - Legal notice