We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...
Based on data from a large-scale experiment with human subjects, we conclude that the logarithm of probability to guess a word in context (unpredictability) depends linearly on the...
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
A key challenge in devising solutions to a range of problems associated with business process management: process life cycle management, compliance management, enterprise process ...
Data Warehouse (DWH) information is accessed by business processes, and sometimes may also initiate changes of the control flow of business process instances. Today, there are no ...