scientific article
From MaRDI portal
Publication:3736916
zbMath0601.68049MaRDI QIDQ3736916
Juhani Karhumäki, H. C. M. Kleijn
Publication date: 1985
Full work available at URL: https://eudml.org/doc/92230
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
The equivalence of finite valued transducers (on HDT0L languages) is decidable ⋮ Balance of many-valued transductions and equivalence problems ⋮ Bifaithful starry transductions ⋮ New techniques for proving the decidability of equivalence problem ⋮ Multiplicities: A deterministic view of nondeterminism ⋮ The undecidability of some equivalence problems concerning ngsm's and finite substitutions ⋮ A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language ⋮ Cardinality problems of compositions of morphisms and inverse morphisms ⋮ Finite transducers and rational transductions ⋮ Inverse morphic equivalence on languages ⋮ On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages
Cites Work
- Inverse morphic equivalence on languages
- A homomorphic characterization of regular languages
- A note on morphic characterization of languages
- Single-valued a-transducers
- On the decidability of homomorphism equivalence for languages
- A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language
- A homomorphic characterization of principal semi AFLs without using intersection with regular sets
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
