Outfix and infix codes and related classes of languages

From MaRDI portal
Publication:1186552

DOI10.1016/0022-0000(91)90026-2zbMath0794.68087OpenAlexW2094183349MaRDI QIDQ1186552

H. J. Shyr, Masami Ito, Helmut Jürgensen, Gabriel Thierrin

Publication date: 28 June 1992

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(91)90026-2

zbMATH Keywords

extremal propertyblock orderinginfix codesoutfix codes


Mathematics Subject Classification ID

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


Related Items

On some factorizations of infinite words by elements of codes, INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES, OVERLAP-FREE LANGUAGES AND SOLID CODES, Congruences, infix and cohesive prefix codes, The syntactic monoid of hairpin-free languages, Finite Completion of comma-free codes Part 1, Finite Completion of comma-free codes Part 2, On codes defined by bio-operations, Structure of 3-infix-outfix maximal codes., Some results on \((k, m)\)-comma codes, Languages whose \(n\)-element subsets are codes, On group codes, Automata for solid codes, \(k\)-p-infix codes and semaphore codes, Out Subword-Free Languages and Its Subclasses, A note on autodense related languages, Brick codes: families, properties, relations, K-catenation and applications:k-prefix codes, Some combinatorial properties of solid codes, Representing recursively enumerable languages by iterated deletion, Product of Finite Maximal P-Codes. This paper was supported in part by HK UGC grants 9040596, 9040511 and City U Strategic Grants 7001189, 7001060, and by the Natural Science Foundation of China (project No. 60073056) and the Guangdong Provincial Natural Science Foundation (project No. 001174), Right \(k\)-dense languages



Cites Work

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