Extended sequentialization of transducers

DOI10.1007/3-540-44674-5_32MaRDI QIDQ4540983zbMATH OpenFDO

Authors Tamás Gaál

Publication date 28 July 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2088/20880333

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1870549
• Minimization algorithms for sequential transducers
• Determinization of transducers over finite and infinite words.
• scientific article; zbMATH DE number 1949651
• Minimizing subsequential transducers: a survey.

Cited in

(18)

• Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
• Minimization algorithms for sequential transducers
• Generalised twinning property
• A general class of monoids supporting canonisation and minimisation of (sub)sequential transducers
• Determinization of transducers over finite and infinite words.
• Minimizing subsequential transducers: a survey.
• Determinization of transducers over infinite words: The general case
• Minimization of symbolic transducers
• Determinization of transducers over infinite words
• scientific article; zbMATH DE number 1962764 (Why is no real title available?)
• scientific article; zbMATH DE number 2050927 (Why is no real title available?)
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality of transducers
• scientific article; zbMATH DE number 1870549 (Why is no real title available?)
• A canonical semi-deterministic transducer
• Sequentiality of string-to-context transducers
• Transducing Markov sequences
• On implementing recognizable transductions
• Sequences of words defined by two-way transducers

This page was built for publication: Extended sequentialization of transducers

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