Outfix and infix codes and related classes of languages
From MaRDI portal
Publication:1186552
DOI10.1016/0022-0000(91)90026-2zbMATH Open0794.68087OpenAlexW2094183349MaRDI QIDQ1186552FDOQ1186552
Authors: 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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Homomorphisms and subdirect decompositions of semigroups
- Reflective star languages and codes
- Anti-commutative languages and n-codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- n-Prefix–suffix languages∗
- Ordered catenation and regular free disjunctive languages
- Semaphore Codes and Ideals
- Hypercodes, Right Convex Languages and their Syntactic Monoids
- Title not available (Why is that?)
- E-convex infix codes
- Title not available (Why is that?)
Cited In (22)
- INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
- The syntactic monoid of hairpin-free languages
- Overlap-free languages and solid codes
- 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)
- A note on autodense related languages
- Finite Completion of comma-free codes Part 1
- Finite Completion of comma-free codes Part 2
- K-catenation and applications:k-prefix codes
- Automata for solid codes
- On some factorizations of infinite words by elements of codes
- \(k\)-p-infix codes and semaphore codes
- Representing recursively enumerable languages by iterated deletion
- Structure of 3-infix-outfix maximal codes.
- On codes defined by bio-operations
- Brick codes: families, properties, relations
- Languages whose \(n\)-element subsets are codes
- Congruences, infix and cohesive prefix codes
- Right \(k\)-dense languages
- Some results on \((k, m)\)-comma codes
- On group codes
- Out subword-free languages and its subclasses
- Some combinatorial properties of solid codes
This page was built for publication: Outfix and infix codes and related classes of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186552)
