On the containment and equivalence problems for two-way transducers
type: Item
instance of: scholarly article
title: On the containment and equivalence problems for two-way transducers
zbMATH Open document ID: 1238.68077
author: Oscar H. Ibarra
author: Hsu-Chun Yen
published in: Theoretical Computer Science
publication date: 2012-05-30T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6039171
zbMATH Keywords: two-way transducer
zbMATH Keywords: containment problem
zbMATH Keywords: equivalence problem
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.12.034
OpenAlex ID: W2084335565
cites work: Expressiveness of streaming string transducers
cites work: Nondeterministic Streaming String Transducers
cites work: The equivalence of finite valued transducers (on HDT0L languages) is decidable
cites work: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
cites work: The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
cites work: The complexity of decision problems for finite-turn multicounter machines
cites work: A note on finite-valued and finitely ambiguous transducers
cites work: Q3862379
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
cites work: On the universe, disjointness, and containment problems for simple machines
cites work: Q5740422
cites work: Decomposing Finite-Valued Transducers and Deciding Their Equivalence
DOI: 10.1016/J.TCS.2011.12.034
description: scientific article; zbMATH DE number 6039171