We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
Determining the semantic intent of web queries not only involves identifying their semantic class, which is a primary focus of previous works, but also understanding their semanti...
Abstract--Domain knowledge for web applications is currently being made available as domain ontology with the advent of the semantic web, in which semantics govern relationships am...
act We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the ...