Sciweavers

762 search results - page 60 / 153
» Intercode Regular Languages
Sort
View
140
Voted
ICALP
2000
Springer
15 years 6 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
RTA
2000
Springer
15 years 6 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren
106
Voted
LATA
2009
Springer
15 years 9 months ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger
ICMLC
2010
Springer
15 years 12 days ago
Data mining model in analyzing portuguese studies as the second language acquisition
: Portuguese is specifically a difficult language with luxuriant tenses, and second language acquisition (SLA) is regarded as highly variable. Many (Chinese) students who learn Por...
Sam Chao, Fai Wong, CustoDio Cavaco Martins
ADC
2009
Springer
123views Database» more  ADC 2009»
15 years 9 months ago
S.E.A.L. - A Query Language for Entity-Association Queries
The paper presents the S.E.A.L. query language and interpreter for entity-association queries that allows such queries to be expressed in a much simpler way than in SQL. S.E.A.L (...
Edward Stanley, Pavle Mogin, Peter Andreae