5096 search results - page 28 / 1020 » Associations as a Language Construct |
IPL
2008
14 years 11 months ago
2008
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
COLING
2008
15 years 1 months ago
2008
Our research organization has been constructing a large scale database named SHACHI by collecting detailed meta information on language resources (LRs) in Asia and Western countri...
RP
2010
Springer
14 years 9 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
95
Voted
WWW
2008
ACM
16 years 13 days ago
2008
ACM
Complex dialogs with comprehensive underlying data models are gaining increasing importance in today's Web applications. This in turn accelerates the need for highly dynamic ...
LREC
2008
15 years 1 months ago
2008
The National Institute of Information and Communications Technology (NICT) and Nagoya University have been jointly constructing a large scale database named SHACHI by collecting d...