A proof of Choffrut's theorem on subsequential functions

DOI10.1016/S0304-3975(98)00163-7zbMath0913.68120OpenAlexW2052865572MaRDI QIDQ1285595

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)

Related Items (4)

Subsequential transducers: a coalgebraic perspective ⋮ Sequential? ⋮ Squaring transducers: An efficient procedure for deciding functionality and sequentiality. ⋮ Coalgebraising Subsequential Transducers

Cites Work

• The suffix tree of a tree and minimizing sequential transducers
• Minimization algorithms for sequential transducers
• Minimization of Rational Word Functions
• Automata in general algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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