output
20172026
most citedSwitching quantum reference frames in the N-body problem and the absence of global relational perspectives

60 citations

researchers with a paper here
collaborating institutions
Showing cs.FLShow all

5 papers · 1 filter

cs.FL2023★ 1 cited

Analyzing Robustness of Angluin's L Algorithm in Presence of Noise

Lina Ye, Igor Khmelnitsky, Serge Haddad +5

Angluin's L algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively…

cs.FL2022

Z-polyregular functions

Thomas Colcombet, Gaëtan Douéneau-Tabot, Aliaume Lopez

This paper introduces a robust class of functions from finite words to integers that we call Z-polyregular functions. We show that it admits natural characterizations in terms of l…

cs.FL2021

Fast zone-based algorithms for reachability in pushdown timed automata

S. Akshay, Paul Gastin, Karthik R Prakash

Given the versatility of timed automata a huge body of work has evolved that considers extensions of timed automata. One extension that has received a lot of interest is timed auto…

cs.FL2021★ 2 cited

Asynchronous wreath product and cascade decompositions for concurrent behaviours

Bharat Adsul, Paul Gastin, Saptarshi Sarkar +1

We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These tools reflect the distributed nat…

cs.FL2020★ 2 cited

Gauge-invariance in cellular automata

Pablo Arrighi, Giuseppe Di Molfetta, Nathanaël Eon

Gauge-invariance is a fundamental concept in Physics -- known to provide mathematical justification for the fundamental forces. In this paper, we provide discrete counterparts to t…