scientific article; zbMATH DE number 826059
From MaRDI portal
Publication:4858445
zbMATH Open0838.68067MaRDI QIDQ4858445FDOQ4858445
Authors: Tom Head, Andreas Weber 
Publication date: 27 May 1996
Title of this publication is not available (Why is that?)
Recommendations
Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25) Parallel algorithms in computer science (68W10)
Cited In (20)
- Variants of codes and indecomposable languages
- Theoretical and implementational aspects of the formal language server (LaSer)
- Transducers for the bidirectional decoding of prefix codes
- Factorization in Formal Languages
- The finest homophonic partition and related code concepts
- Error-correction, and finite-delay decodability
- Decidability of code properties
- Estimating the minimal number of states of a subsequential decoder
- Some properties of sets given by finite R-transducers
- Deciding the immutability of regular codes and languages under finite transduction
- Language equations, maximality and error-detection
- Automata accepting bifix codes
- Transducers and the decidability of independence in free monoids
- Decidability of code properties
- Testing DNA code words properties of regular languages
- Formal descriptions of code properties: decidability, complexity, implementation
- Implementation of Code Properties via Transducers
- A fast algorithm for the unique decipherability of multivalued encodings
- Transducer descriptions of DNA code properties and undecidability of antimorphic problems
- Title not available (Why is that?)
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)
