Using acceptors as transducers

DOI10.1016/S0304-3975(00)00297-8MaRDI QIDQ5958726zbMATH OpenFDO

Authors Matti Nykänen

Publication date 3 March 2002

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

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00297-8

zbMATH Keywords

finiteness dependenciesmulti-tape automatatransducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1452986
• On the ambiguity and finite-valuedness problems in acceptors and transducers
• scientific article; zbMATH DE number 1929941
• On the ambiguity, finite-valuedness, and lossiness problems in acceptors and transducers
• Two-way transducers with a two-way output tape

Cites work

• A framework for testing safety and effective computability
• Absolutely parallel grammars and two-way finite-state transducers
• Deriving constraints among argument sizes in logic programs
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1173828 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Multi-tape and multi-head pushdown automata
• On the lengths of values in a finite transducer
• On the valuedness of finite transducers
• Reasoning about strings in databases
• Regular sequence operations and their use in database queries
• Sequences, datalog, and transducers
• Temporal logic can be more expressive

Cited in

(2)

• Transducers are type-converters
• scientific article; zbMATH DE number 1452986 (Why is no real title available?)

This page was built for publication: Using acceptors as transducers

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