Comparison-free polyregular functions
From MaRDI portal
Cites work
- A pumping lemma for two-way finite transducers
- A short solution for the HDT0L sequence equivalence problem
- Aperiodic string transducers
- Copyful streaming string transducers
- Elements of automata theory. Translated from the French by Reuben Thomas
- Expressiveness of streaming string transducers
- First-order tree-to-tree functions
- scientific article; zbMATH DE number 1929941 (Why is no real title available?)
- scientific article; zbMATH DE number 7724213 (Why is no real title available?)
- Implicit automata in typed -calculi I: aperiodicity in a non-commutative logic
- Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
- Macro tree transducers
- MSO definable string transductions and two-way finite-state transducers
- On polynomial recursive sequences
- Pebble Minimization of Polyregular Functions
- Polynomial automata: zeroness and applications
- Register Transducers Are Marble Transducers
- Regular and First-Order List Functions
- Sequences of Level 1, 2, 3,..., k,...
- Sequences of words defined by two-way transducers
- Simple parsimonious types and logarithmic space
- String-to-string interpretations with polynomial-size output
- Sur les séries associees à certains systèmes de Lindenmayer
- The many facets of string transducers (invited talk)
- Tree transducers, L systems, and two-way machines
- Two-way pebble transducers for partial functions and their composition
- Typechecking for XML transformers
- Word-mappings of level 2
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
This page was built for publication: Comparison-free polyregular functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241239)
