110 search results - page 7 / 22 » Finite-State Registered Automata and Their Uses in Natural L... |
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
IEEESCC
2005
IEEE
14 years 1 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
EACL
2003
ACL Anthology
13 years 8 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
CRV
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a proof of concept system to represent and reason about hockey play. The system takes as input player motion trajectory data tracked from game video and supported by kn...
NLDB
2007
Springer
14 years 1 months ago
2007
Springer
We intend on developing electronic dictionaries and Finite State Transducers for the automatic processing of the Albanian Language. We describe some peculiarities of this language ...