Automated grading of DFA constructions

R Alur, L D'Antoni, S Gulwani, D Kini - IJCAI'13 Proceedings of the …, 2013 - microsoft.com
One challenge in making online education more effective is to develop automatic grading
software that can provide meaningful feedback. This paper provides a solution to automatic …

Generalized alignment-based trace clustering of process behavior

M Boltenhagen, T Chatain, J Carmona - … and Theory of Petri Nets and …, 2019 - Springer
Process mining techniques use event logs containing real process executions in order to
mine, align and extend process models. The partition of an event log into trace variants …

[PDF][PDF] Towards formal relaxed equivalence checking in approximate computing methodology

L Holık, O Lengál, A Rogalewicz… - 2nd Workshop on …, 2016 - wapco.e-ce.uth.gr
Most design automation methods developed for approximate computing evaluate candidate
solutions by applying a set of input vectors and measuring the error of the output vectors with …

Two-way cost automata and cost logics over infinite trees

A Blumensath, T Colcombet, D Kuperberg… - Proceedings of the …, 2014 - dl.acm.org
Regular cost functions provide a quantitative extension of regular languages that retains
most of their important properties, such as expressive power and decidability, at least over …

Model-based trace variant analysis of event logs

M Boltenhagen, T Chatain, J Carmona - Information Systems, 2021 - Elsevier
The comparison of trace variants of business processes opens the door for a fine-grained
analysis of the distinctive features inherent in the executions of a process in an organization …

Absent subsequences in words

M Kosche, T Koß, F Manea… - Fundamenta …, 2023 - journals.sagepub.com
An absent factor of a string w is a string u which does not occur as a contiguous substring
(aka factor) inside w. We extend this well-studied notion and define absent subsequences: a …

[HTML][HTML] Bounded repairability of word languages

M Benedikt, G Puppis, C Riveros - Journal of Computer and System …, 2013 - Elsevier
What do you do if a computational object (eg program trace) fails a specification? An
obvious approach is to perform a repair: modify the object minimally to get something that …

Edit Distance of Finite State Transducers

C Aiswarya, A Manuel, S Sunny - arXiv preprint arXiv:2404.16518, 2024 - arxiv.org
We lift metrics over words to metrics over word-to-word transductions, by defining the
distance between two transductions as the supremum of the distances of their respective …

Edit distance for pushdown automata

K Chatterjee, TA Henzinger… - Logical Methods in …, 2017 - lmcs.episciences.org
The edit distance between two words w_1,w_2 is the minimal number of word operations
(letter insertions, deletions, and substitutions) necessary to transform w_1 to w_2. The edit …

[PDF][PDF] Weak cost automata over infinite trees

MTV Boom - 2012 - qmac.ox.ac.uk
Cost automata are traditional finite state automata enriched with a finite set of counters that
can be manipulated on each transition. Based on the evolution of counter values, a cost …