A proof of Choffrut's theorem on subsequential functions

DOI10.1016/S0304-3975(98)00163-7MaRDI QIDQ1285595zbMATH OpenOpenAlexFDO

Authors Véronique Bruyère, Christophe Reutenauer

Publication date 28 April 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(98)00163-7

zbMATH Keywords

rationalmachinesubsequential

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3653575 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 19761 (Why is no real title available?)
• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• Automata in general algebras
• Minimization algorithms for sequential transducers
• Minimization of Rational Word Functions
• The suffix tree of a tree and minimizing sequential transducers

Cited in

(7)

• Coalgebraising subsequential transducers
• A direct proof of the theorem on formal functions
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• Subsequential transducers: a coalgebraic perspective
• A sequential implicit function theorem for the chords iteration
• Euclidean division by \(d\) in base \(b\)
• Sequential?

This page was built for publication: A proof of Choffrut's theorem on subsequential functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285595)