On the containment and equivalence problems for GSMs, transducers, and linear CFGs

Authors:
Oscar H. Ibarra
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA
Venue:
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Year:
2011

Citing 6
Cited 0

The equivalence of finite valued transducers (on HDT0L languages) is decidable

Theoretical Computer Science
On the valuedness of finite transducers

Acta Informatica
Decomposing finite-valued transducers and deciding their equivalence

SIAM Journal on Computing
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
Reversal-bounded multipushdown machines

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore the boundaries between decidability and undecidability of the containment and equivalence problems for restricted classes of nondeterministic generalized sequential machines (NGSMs), nondeterministic finite transducers (NFTs), nondeterministic pushdown transducers (NPDTs), and linear context-free grammars (LCFGs). We believe that our results are the sharpest known to date concerning these devices.