scientific article; zbMATH DE number 826059
From MaRDI portal
Publication:4858445
Recommendations
Cited in
(22)- Automata accepting bifix codes
- Some properties of sets given by finite R-transducers
- Deciding the immutability of regular codes and languages under finite transduction
- Decidability of code properties
- Variants of codes and indecomposable languages
- Applications of transducers in independent languages, word distances, codes
- Decidability of code properties
- Methods for relativizing properties of codes
- Language equations, maximality and error-detection
- Estimating the minimal number of states of a subsequential decoder
- The finest homophonic partition and related code concepts
- Testing DNA code words properties of regular languages
- Implementation of code properties via transducers
- Factorization in formal languages
- Symbolic manipulation of code properties
- Error-correction, and finite-delay decodability
- Transducers and the decidability of independence in free monoids
- Theoretical and implementational aspects of the formal language server (LaSer)
- Transducers for the bidirectional decoding of prefix codes
- Formal descriptions of code properties: decidability, complexity, implementation
- scientific article; zbMATH DE number 777294 (Why is no real title available?)
- A fast algorithm for the unique decipherability of multivalued encodings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858445)
