scientific article; zbMATH DE number 1773083

MaRDI QIDQ4540966zbMATH OpenFDO

Authors André Kempe

Publication date 28 July 2002

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
• A disambiguation algorithm for finite automata and functional transducers
• Extraction and recoding of input-\(\varepsilon\)-cycles in finite state transducers.
• Finite state transducers
• scientific article; zbMATH DE number 1045406

Cited in

(6)

• Parsing natural language idioms with bidirectional finite-state machines
• Space-efficient bimachine construction based on the equalizer accumulation principle
• scientific article; zbMATH DE number 3917745 (Why is no real title available?)
• Extraction and recoding of input-\(\varepsilon\)-cycles in finite state transducers.
• A unified framework for disambiguating finite transductions
• scientific article; zbMATH DE number 1949656 (Why is no real title available?)

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 Q4540966)