Properties of Finite and Pushdown Transducers

DOI10.1137/0212019zbMath0512.68065OpenAlexW2029722901MaRDI QIDQ3657458

Karel II Culik, Christian Choffrut

Publication date: 1983

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0212019

zbMATH Keywords

equivalence problemrational relationssubsequential functionssequential transducersgeneralized sequential machinesclasses of transducerspushdown translations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (13)

Weighted restarting automata and pushdown relations ⋮ Deterministic Ordered Restarting Automata that Compute Functions ⋮ Representation and uniformization of algebraic transductions ⋮ Unnamed Item ⋮ Weighted Restarting Automata and Pushdown Relations ⋮ Asynchronous Parallel Communicating Systems of Pushdown Automata ⋮ Decomposition and factorization of chemical reaction transducers ⋮ Synchronizing relations on words ⋮ On the descriptional complexity of stateless deterministic ordered restarting automata ⋮ Restarting transducers, regular languages, and rational relations ⋮ Some formal tools for analyzing quantum automata. ⋮ Transforming a single-valued transducer into a Mealy machine ⋮ Deterministic sequential functions

This page was built for publication: Properties of Finite and Pushdown Transducers