scientific article; zbMATH DE number 1773097

zbMATH Open0989.68513MaRDI QIDQ4540983FDOQ4540983

Authors: Tamás Gaál 

Publication date: 28 July 2002

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

Title of this publication is not available (Why is that?)

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.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (17)

• Determinization of transducers over infinite words: The general case
• Title not available (Why is that?)
• On implementing recognizable transductions
• Transducing Markov sequences
• Title not available (Why is that?)
• Generalised twinning property
• Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
• Sequences of words defined by two-way transducers
• A general class of monoids supporting canonisation and minimisation of (sub)sequential transducers
• Minimization of symbolic transducers
• Title not available (Why is that?)
• Determinization of transducers over finite and infinite words.
• Minimizing subsequential transducers: a survey.
• Sequentiality of string-to-context transducers
• A canonical semi-deterministic transducer
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

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