Comparison-free polyregular functions - Archive ouverte HAL Access content directly
Conference Papers Year :

Comparison-free polyregular functions

(1) , , (2)
Camille Noûs
Pierre Pradic
  • Function : Author
  • PersonId : 1080771


This paper introduces a new automata-theoretic class of string-to-string functions with polynomial growth. Several equivalent definitions are provided: a machine model which is a restricted variant of pebble transducers, and a few inductive definitions that close the class of regular functions under certain operations. Our motivation for studying this class comes from another characterization, which we merely mention here but prove elsewhere, based on a λ-calculus with a linear type system. As their name suggests, these comparison-free polyregular functions form a subclass of polyregular functions; we prove that the inclusion is strict. We also show that they are incomparable with HDT0L transductions, closed under usual function composition – but not under a certain “map” combinator – and satisfy a comparison-free version of the pebble minimization theorem. On the broader topic of polynomial growth transductions, we also consider the recently introduced layered streaming string transducers (SSTs), or equivalently k-marble transducers. We prove that a function can be obtained by composing such transducers together if and only if it is polyregular, and that k-layered SSTs (or k-marble transducers) are closed under “map” and equivalent to a corresponding notion of (k+1)-layered HDT0L systems.
Fichier principal
Vignette du fichier
comparison-free-polyregular-hal.pdf (1.11 Mo) Télécharger le fichier

Dates and versions

hal-02986228 , version 1 (02-11-2020)
hal-02986228 , version 2 (13-05-2021)



Lê Thành Dũng Tito Nguyễn, Camille Noûs, Pierre Pradic. Comparison-free polyregular functions. International Colloquium on Automata, Languages and Programming 2021, Jul 2021, Glasgow, United Kingdom. ⟨hal-02986228v2⟩
184 View
103 Download



Gmail Facebook Twitter LinkedIn More