3653 search results - page 112 / 731 » On Recognizable Timed Languages |
140
click to vote
IS
2011
14 years 5 months ago
2011
Abstract. Process mining allows for the automated discovery of process models from event logs. These models provide insights and enable various types of model-based analysis. This ...
ENGL
2007
14 years 10 months ago
2007
In this paper we introduce a finite automaton called partial finite automaton to recognize partial languages. We have defined three classes of partial languages, viz., local pa...
CICLING
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we describe systems for automatic labeling of time expressions occurring in English and Chinese text as specified in the ACE Temporal Expression Recognition and Nor...
CONCUR
2006
Springer
14 years 12 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
CASES
2006
ACM
15 years 4 months ago
2006
ACM
This paper considers the efficient parallel implementation of control constructs and expressions written in a common software programming language and synthesised to FPGA platform...