On the Decidability of the Equivalence for k-Valued Transducers (Q3533016): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1566080944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a $k$-valued transducer into $k$ unambiguous ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decidability of Bounded Valuedness for Transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squaring transducers: An efficient procedure for deciding functionality and sequentiality. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finite-valued and finitely ambiguous transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multitape one-way nonwriting automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-valued a-transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of finite valued transducers (on HDT0L languages) is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Finite-Valued Transducers and Deciding Their Equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of decision problems for finite-turn multicounter machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A construction on finite automata that has remained hidden / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the valuedness of finite transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651209 / rank
 
Normal rank

Latest revision as of 19:24, 28 June 2024

scientific article
Language Label Description Also known as
English
On the Decidability of the Equivalence for k-Valued Transducers
scientific article

    Statements

    On the Decidability of the Equivalence for k-Valued Transducers (English)
    0 references
    0 references
    30 October 2008
    0 references
    0 references
    0 references