Single-valued a-transducers

DOI10.1016/S0022-0000(77)80033-0zbMath0367.94071OpenAlexW2061054158MaRDI QIDQ1242878

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)

Related Items (23)

A note on finite-valued and finitely ambiguous transducers ⋮ Transductions and the parallel generation of languages^† ⋮ Rational equivalence relations ⋮ The equivalence of finite valued transducers (on HDT0L languages) is decidable ⋮ Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ A unified framework for disambiguating finite transductions ⋮ Deciding the immutability of regular codes and languages under finite transduction ⋮ On the decidability of the valuedness problem for two-way finite transducers ⋮ Equivalence Checking Problem for Finite State Transducers over Semigroups ⋮ Codeterministic Lindenmayer schemes and systems ⋮ New techniques for proving the decidability of equivalence problem ⋮ On the Decidability of the Equivalence for k-Valued Transducers ⋮ On some transducer equivalence problems for families of languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The decidability of equivalence for deterministic finite transducers ⋮ On Synthesis of Resynchronizers for Transducers ⋮ Cardinality problems of compositions of morphisms and inverse morphisms ⋮ Finite transducers and rational transductions ⋮ On the equivalence of some transductions involving letter to letter morphisms on regular languages ⋮ Determinization of transducers over finite and infinite words. ⋮ Squaring transducers: An efficient procedure for deciding functionality and sequentiality. ⋮ On the lengths of values in a finite transducer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transductions des langages de Chomsky
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• Studies in abstract families of languages

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