Generalizations of code languages with marginal errors
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5605126 (Why is no real title available?)
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 1998341 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 194974 (Why is no real title available?)
- A Method for the Construction of Minimum-Redundancy Codes
- A variant of a recursively unsolvable problem
- An improved prefix-free regular-expression matching
- Automata and forbidden words
- DFA with a Bounded Activity Level
- DNA Codes and Their Properties
- INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
- Intercode regular languages
- On the Ornstein-Uhlenbeck operators on Wiener-Riemannian manifolds
- Prefix-free regular languages and pattern matching
Cited in
(4)
This page was built for publication: Generalizations of code languages with marginal errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451108)