Theoretical and implementational aspects of the formal language server (LaSer)
From MaRDI portal
Publication:2106613
Recommendations
Cites work
- An algebra of discrete channels that involve combinations of three basic error types
- Applications of transducers in independent languages, word distances, codes
- Bond-free DNA language classes
- Codes and automata.
- Coding properties of DNA languages.
- Elements of automata theory. Translated from the French by Reuben Thomas
- Embedding rationally independent languages into maximal ones
- scientific article; zbMATH DE number 5605092 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3566726 (Why is no real title available?)
- scientific article; zbMATH DE number 1354855 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 826059 (Why is no real title available?)
- On Relations Defined by Generalized Finite Automata
- Site-directed insertion: decision problems, maximality and minimality
- Testing DNA code words properties of regular languages
- Trajectory-based codes
This page was built for publication: Theoretical and implementational aspects of the formal language server (LaSer)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106613)