A more efficient notion of zigzag stability
From MaRDI portal
Recommendations
Cites work
- A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes
- A note on the reduction of two-way automata to one-way automata
- Automates et codes zigzag
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- On $z$-submonoids and $z$-codes
- On coding morphisms for zigzag codes
- Stability for the zigzag submonoids
- Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability)
Cited in
(5)
This page was built for publication: A more efficient notion of zigzag stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717039)