1000 search results - page 128 / 200 » Dependency Tree Automata |
97
Voted
EACL
2003
ACL Anthology
15 years 2 months ago
2003
ACL Anthology
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
121
click to vote
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
119
click to vote
RTSS
2008
IEEE
15 years 7 months ago
2008
IEEE
The Real-Time Calculus (RTC) framework proposed in [Chakraborty et al., DATE 2003] and subsequently extended in [Wandeler et al., Real-Time Systems 29(2-3), 2005] and a number of ...
113
Voted
FUIN
2007
15 years 20 days ago
2007
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
111
click to vote
QEST
2010
IEEE
14 years 10 months ago
2010
IEEE
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...