644 search results - page 11 / 129 » Precedence Automata and Languages |
CAV
2006
Springer
13 years 11 months ago
2006
Springer
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
WIA
2004
Springer
14 years 22 days ago
2004
Springer
d abstract) Gaoyan Xie, Cheng Li, and Zhe Dang School of Electrical Engineering and Computer Science Washington State University Pullman, WA 99164, USA Abstract. In this paper, ...
JCSS
2007
13 years 7 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
IFIPTCS
2000
13 years 11 months ago
2000
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we...