Decompositions of recognizable strong maximal codes

From MaRDI portal

DOI10.1016/0304-3975(93)90235-LMaRDI QIDQ685444zbMATH OpenFDO

Authors Liang Zhang, Weide Qiu

Publication date 9 January 1994

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(93)90235-L


zbMATH Keywords

decomposition of codesrecognizable codesstrong codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)




Review text

We study the decompositions of recognizable strong maximal codes. The main results are: (1) Any recognizable strong maximal code \(X\) can be decomposed to a finite number of indecomposable (in the sense of strong codes) recognizable strong maximal codes. This decomposition corresponds to the composition series of the syntactic group of \(X^*\). (2) We propose a special class of recognizable strong maximal codes, the so-called solvable strong codes which is a recognizable strong maximal code \(X\) such that the syntactic group of \(X^*\) is a solvable group. By (1), any solvable strong maximal code can be decomposed to a finite number of indecomposable (in the sense of general codes) strong maximal codes. For the indecomposable strong maximal codes (in the sense of general codes), a structure formula is given.


Recommendations


Cites work


Cited in
(7)








This page was built for publication: Decompositions of recognizable strong maximal codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685444)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Decompositions_of_recognizable_strong_maximal_codes&oldid=78188945"
Powered by MediaWiki