10 citations · 44 across the 22 of their papers we have counts for
4 papers · 2 filters
Modular Descriptions of Regular Functions
Paul Gastin
We discuss various formalisms to describe string-to-string transformations. Many are based on automata and can be seen as operational descriptions, allowing direct implementations…
Logics for Reversible Regular Languages and Semigroups with Involution
Paul Gastin, Amaldev Manuel, R. Govind
We present MSO and FO logics with predicates `between' and `neighbour' that characterise various fragments of the class of regular languages that are closed under the reverse opera…
Fast algorithms for handling diagonal constraints in timed automata
Paul Gastin, Sayan Mukherjee, B Srivathsan
A popular method for solving reachability in timed automata proceeds by enumerating reachable sets of valuations represented as zones. A naïve enumeration of zones does not termina…
Aperiodic Weighted Automata and Weighted First-Order Logic
Manfred Droste, Paul Gastin
By fundamental results of Schützenberger, McNaughton and Papert from the 1970s, the classes of first-order definable and aperiodic languages coincide. Here, we extend this equivale…