Implementation of code properties via transducers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 50943 (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?)
- A Pushdown Transducer Extension for the OpenFst Library
- Applications of symbolic finite automata
- Codes and automata.
- Codes defined by multiple sets of trajectories
- Elements of automata theory. Translated from the French by Reuben Thomas
- Error-correction, and finite-delay decodability
- Formal descriptions of code properties: decidability, complexity, implementation
- Implementation and Application of Automata
- Insertion/Deletion Detecting Codes and the Boundary Problem
- Introducing VAUCANSON
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Symbolic manipulation of code properties
- Trajectory-based codes
- \textit{Grail}: A C++ library for automata and expressions
Cited in
(3)
This page was built for publication: Implementation of code properties via transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830220)