FINITE COMPLETIONS VIA FACTORIZING CODES
From MaRDI portal
Publication:5386969
Recommendations
Cites work
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 1047958 (Why is no real title available?)
- A non-ambiguous decomposition of regular languages and factorizing codes
- A note on codes having no finite completions
- A partial result about the factorization conjecture for finite variable- length codes
- An application of Hajós factorizations to variable-length codes
- An enhanced property of factorizing codes
- Completing codes
- Construction of a family of finite maximal codes
- Hajós factorizations and completion of codes.
- Noncommutative factorization of variable-length codes
- ON A PROPERTY OF THE FACTORIZING CODES
- On a complete set of operations for factorizing codes
- On codes having no finite completions
- On factorizing codes: Structural properties and related decision problems
- On some Schützenberger conjectures
- On the factorisation of finite abelian groups
- Synchronization and decomposability for a family of codes. II
Cited in
(13)- scientific article; zbMATH DE number 5117090 (Why is no real title available?)
- A note on codes having no finite completions
- Shortening Array Codes and the Perfect $1$-Factorization Conjecture
- Completing codes in a sofic shift
- On codes having no finite completion
- On factorizing codes: Structural properties and related decision problems
- On a complete set of operations for factorizing codes
- Hajós factorizations and completion of codes.
- Completing solid codes to maximal comma-free codes
- An enhanced property of factorizing codes
- The Exhaustion Numbers of the Generalized Quaternion Groups
- A note on the factorization conjecture
- ON A PROPERTY OF THE FACTORIZING CODES
This page was built for publication: FINITE COMPLETIONS VIA FACTORIZING CODES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386969)
