Finite transducers and rational transductions
type: Item
instance of: scholarly article
title: Finite transducers and rational transductions
author: Tero Harju
author: Juhani Karhumäki
publication date: 2022-02-04T00:00:00Z
review text: Summary: For the entire collection see [Zbl 1470.68001].
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7469501
MaRDI profile type: Publication
cites work: A proof of Ehrenfeucht's conjecture
cites work: Determinization of transducers over finite and infinite words.
cites work: The undecidability of the domino problem
cites work: Q3859267
cites work: Single-valued a-transducers
cites work: Adherences of languages
cites work: Partial-Observation Stochastic Games
cites work: Sequences of words defined by two-way transducers
cites work: A note on decidability questions on presentations of word semigroups
cites work: Q5526125
cites work: A Purely Homomorphic Characterization of Recursively Enumerable Sets
cites work: An aperiodic set of 13 Wang tiles
cites work: Systems of equations over a free monoid and Ehrenfeucht's conjecture
cites work: The equivalence of finite valued transducers (on HDT0L languages) is decidable
cites work: Q3870326
cites work: On the decidability of homomorphism equivalence for languages
cites work: Uniformisation of Two-Way Transducers
cites work: Q4079524
cites work: On Relations Defined by Generalized Finite Automata
cites work: The Degree of Squares is an Atom
cites work: Degrees of Infinite Words, Polynomials and Atoms
cites work: Degrees of Transducibility
cites work: Q4938634
cites work: MSO definable string transductions and two-way finite-state transducers
cites work: Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
cites work: Multitape one-way nonwriting automata
cites work: Number representation and finite automata
cites work: A representation of recursively enumerable languages by two homomorphisms and a quotient
cites work: The Hardest Context-Free Language
cites work: Remarks on blind and partially blind one-way multicounter machines
cites work: Hierarchy theorems for two-way finite state transducers
cites work: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
cites work: Q3751772
cites work: A note on finite-valued and finitely ambiguous transducers
cites work: Q4265634
cites work: Undecidability of the equivalence of finite substitutions on regular language
cites work: The equivalence problem of multitape finite automata
cites work: Q4714446
cites work: Decidability problems for unary output sequential transducers
cites work: Compositional representation of rational functions
cites work: Deterministic sequential functions
cites work: Q4198075
cites work: The equivalence problem for languages defined by transductions on D0L languages
cites work: The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
cites work: Q3746906
cites work: Q3782812
cites work: Q3736916
cites work: A note on morphic characterization of languages
cites work: The Equivalence Problem of Finite Substitutions on ab*c, with Applications
cites work: Efficient constructions of test sets for regular and context-free languages
cites work: A small aperiodic set of Wang tiles
cites work: STACS 2004
cites work: The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
cites work: Q3674079
cites work: A new normal form for the compositions of morphisms and inverse morphisms
cites work: Q4430309
cites work: On Synchronizing Automata and Uniform Distribution
cites work: Minimal undecidable identity problem for finite-automaton mappings
cites work: Equivalence of transducers relative to regular languages
cites work: The equivalence problem for finite substitutions in a regular language
cites work: Equivalence problems for transducers with a bounded number of states
cites work: Transductions des langages de Chomsky
cites work: An application of the matrix representation of transductions
cites work: A topological approach to transductions
cites work: How to decide continuity of rational functions on infinite words
cites work: Q5541339
cites work: Minimization of Rational Word Functions
cites work: Q5678435
cites work: Q4194484
cites work: Q3680279

Finite transducers and rational transductions (cites work)
cites work: Q4155837

Finite transducers and rational transductions (cites work)
cites work: Q4101446

Finite transducers and rational transductions (cites work)
cites work: Q4599512

Finite transducers and rational transductions (cites work)
cites work: A homomorphic characterization of principal semi AFLs without using intersection with regular sets

Finite transducers and rational transductions (cites work)
cites work: Q4005181

Finite transducers and rational transductions (cites work)
cites work: The undecidability of some equivalence problems concerning ngsm's and finite substitutions

Finite transducers and rational transductions (cites work)
cites work: On the valuedness of finite transducers

Finite transducers and rational transductions (cites work)
cites work: Decomposing a $k$-valued transducer into $k$ unambiguous ones

Finite transducers and rational transductions (full work available at URL)
full work available at URL: https://doi.org/10.4171/automata-1/3

Finite transducers and rational transductions (OpenAlex ID)
OpenAlex ID: W4206020540

Finite transducers and rational transductions (DOI)
DOI: 10.4171/AUTOMATA-1/3