10 citations · 19 across the 25 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2020
Automata Tutor v3
Loris D'Antoni, Martin Helfrich, Jan Kretinsky +2
Computer science class enrollments have rapidly risen in the past decade. With current class sizes, standard approaches to grading and providing personalized feedback are no longer…
cs.FL2018
Symbolic Register Automata
Loris D'Antoni, Tiago Ferreira, Matteo Sammartino +1
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automa…
cs.FL2012★ 1 cited
In the Maze of Data Languages
Loris D'Antoni
In data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. Extensions of automata and logics over finite…