Some decidability results about regular and pushdown translations
From MaRDI portal
(Redirected from Publication:1253937)
Cites work
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- On the decidability of homomorphism equivalence for languages
- Optimization of LR(k) parsers
- The decidability of the equivalence problem for DOL-systems
Cited in
(14)- On the equivalence of some transductions involving letter to letter morphisms on regular languages
- Inverse morphic equivalence on languages
- An undecidable problem for context-free grammars
- On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages
- Two decidability problems for infinite words
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- Balance of many-valued transductions and equivalence problems
- 2DST mappings of languages and related problems
- Checking sets, test sets, rich languages and commutatively closed languages
- Dominoes over a free monoid
- On some transducer equivalence problems for families of languages
- A homomorphic characterization of time and space complexity classes of languages†
- On some decision questions concerning pushdown machines
- New techniques for proving the decidability of equivalence problem
This page was built for publication: Some decidability results about regular and pushdown translations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1253937)
