scientific article; zbMATH DE number 1354855
From MaRDI portal
Publication:4269136
Recommendations
- The Syntactic Monoid of an Infix Code
- Groups in the syntactic monoid of a composed code
- The syntactic monoid of the semigroup generated by a comma-free code
- Codes modulo finite monadic string-rewriting systems
- Syntactic Nondeterministic Monoids
- The syntactic monoid of the semigroup generated by a maximal prefix code
- Monoids with disjunctive identity and their codes
- Monoids and maximal codes
- Syntactic monoids in a category
- Codes and maximal monoids
Cited in
(12)- Groups in the syntactic monoid of a composed code
- Automata for solid codes
- The syntactic monoid of hairpin-free languages
- Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
- Distributed catenation and chomsky hierarchy
- Intercodes and the semigroups they generate
- On the maximality of languages with combined types of code properties
- The Syntactic Monoid of an Infix Code
- Implementation of code properties via transducers
- Completely simple codes
- Transducers and the decidability of independence in free monoids
- Theoretical and implementational aspects of the formal language server (LaSer)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4269136)
