Using acceptors as transducers

DOI10.1016/S0304-3975(00)00297-8zbMATH Open0984.68104MaRDI QIDQ5958726FDOQ5958726

Matti Nykänen

Publication date: 3 March 2002

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

zbMATH Keywords

transducersmulti-tape automatafiniteness dependencies

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A framework for testing safety and effective computability
• On the valuedness of finite transducers
• Temporal logic can be more expressive
• Multi-tape and multi-head pushdown automata
• Absolutely parallel grammars and two-way finite-state transducers
• Regular sequence operations and their use in database queries
• Sequences, datalog, and transducers
• On the lengths of values in a finite transducer
• Deriving constraints among argument sizes in logic programs
• Reasoning about strings in databases

Cited In (2)

• Transducers are type-converters
• Title not available (Why is that?)

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)