Pebble minimization: the last theorems

DOI10.1007/978-3-031-30829-1_21arXiv2210.02426OpenAlexW4366503918MaRDI QIDQ6091210

Gaëtan Douéneau-Tabot

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.02426

zbMATH Keywords

factorization forestspebble transducerspolyregular functionsblind pebble transducerslast pebble transducers

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-way pebble transducers for partial functions and their composition
• Factorization forests of finite height
• Regular transducer expressions for regular transformations
• XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
• Green’s Relations and Their Use in Automata Theory
• The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
• MSO definable string transductions and two-way finite-state transducers
• Register Transducers Are Marble Transducers
• An Approach to a Unified Theory of Automata

This page was built for publication: Pebble minimization: the last theorems