Single-valued a-transducers

DOI10.1016/S0022-0000(77)80033-0MaRDI QIDQ1242878zbMATH OpenOpenAlexFDO

Authors Meera Blattner, Tom Head

Publication date 1977

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0022-0000(77)80033-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Cites work

• scientific article; zbMATH DE number 3483582 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• Studies in abstract families of languages
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• Transductions des langages de Chomsky

Cited in

(23)

• The decidability of equivalence for deterministic finite transducers
• Rational equivalence relations
• A unified framework for disambiguating finite transductions
• Transductions and the parallel generation of languages^†
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• Deciding the immutability of regular codes and languages under finite transduction
• Codeterministic Lindenmayer schemes and systems
• Finite transducers and rational transductions
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• The many facets of string transducers (invited talk)
• Equivalence checking problem for finite state transducers over semigroups
• scientific article; zbMATH DE number 3970124 (Why is no real title available?)
• On the lengths of values in a finite transducer
• On some transducer equivalence problems for families of languages
• On the decidability of the valuedness problem for two-way finite transducers
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
• New techniques for proving the decidability of equivalence problem
• On the equivalence of some transductions involving letter to letter morphisms on regular languages
• On Synthesis of Resynchronizers for Transducers
• On the Decidability of the Equivalence for k-Valued Transducers
• Cardinality problems of compositions of morphisms and inverse morphisms
• Determinization of transducers over finite and infinite words.
• A note on finite-valued and finitely ambiguous transducers

This page was built for publication: Single-valued a-transducers

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