Transforming a single-valued transducer into a Mealy machine
type: Item
instance of: scholarly article
title: Transforming a single-valued transducer into a Mealy machine
zbMATH Open document ID: 0914.68137
author: Andreas Weber
published in: Journal of Computer and System Sciences
publication date: 1999-06-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1210191
zbMATH Keywords: transducer
zbMATH Keywords: Mealy machine
MaRDI profile type: Publication
OpenAlex ID: W1969639908
cites work: Q4891188
cites work: Q4299634
cites work: Q3859267
cites work: Q3325046
cites work: Properties of Finite and Pushdown Transducers
cites work: Q3619797
cites work: Q4198056
cites work: A note on finite-valued and finitely ambiguous transducers
cites work: Q3862379
cites work: Concise representations of regular languages by degree and probabilistic finite automata
cites work: Amounts of nondeterminism in finite automata
cites work: Q4268433
cites work: Q4023358
cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
cites work: The complexity of simple computer architectures
cites work: Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
cites work: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
cites work: Relations between varieties of kolmogorov complexities
cites work: Economy of description for single-valued transducers
DOI: 10.1006/JCSS.1997.1517
description: scientific article; zbMATH DE number 1210191