3653 search results - page 387 / 731 » On Recognizable Timed Languages |
148
click to vote
COLING
1992
15 years 8 months ago
1992
This paper focuses on a theory of tense and aspect (the representation of time in natural language) that attempts a formM representation of the relevant liltguistic devices as imp...
202
click to vote
COLING
1990
15 years 8 months ago
1990
':[his paper describes a rule-based machine learning approach to morphological processing in the system called XMAS. XMAS discovers and acquires linguistic rules from example...
153
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
265
click to vote
IANDC
2008
15 years 6 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
156
click to vote
JSYML
2006
15 years 6 months ago
2006
f spaces of signs (abstract real spectra) developed in [1] [18]. We consider pp (positive primitive) formulas in the language of reduced special groups as in [20]. We denote the pp...