Equivalence problem of mappings relative to languages
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4033111
- On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages
- $§igma TC$-порождаемые языки и проблемы относительной эквивалентности
- scientific article; zbMATH DE number 3970124
- scientific article; zbMATH DE number 4039335
Cites work
- 2DST mappings of languages and related problems
- Absolutely parallel grammars and two-way finite-state transducers
- Controlled pushdown automata
- Finite-turn checking automata
- scientific article; zbMATH DE number 4033111 (Why is no real title available?)
- scientific article; zbMATH DE number 3894494 (Why is no real title available?)
- On some transducer equivalence problems for families of languages
- On the decidability of homomorphism equivalence for languages
- On vector languages
- One way finite visit automata
- Simple matrix languages
- The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
Cited in
(5)- On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages
- scientific article; zbMATH DE number 4033111 (Why is no real title available?)
- scientific article; zbMATH DE number 4039335 (Why is no real title available?)
- Palindrome words and reverse closed languages
- The equivalence problem for languages defined by transductions on D0L languages
This page was built for publication: Equivalence problem of mappings relative to languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364102)
