0000000000288520

AUTHOR

Jean Berstel

showing 2 related works from this author

The expressive power of the shuffle product

2010

International audience; There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious operation on regular languages.Antonio Restivo proposed as a challenge to characterize the smallest class of languages containing the singletons and closed under Boolean operations, product and shuffle. This problem is still widely open, but we present some partial results on it. We also study some other smaller classes, including the smallest class containing the languages composed of a single word of length 2 which is closed under Boolean operations and shuffle by a letter (resp. shuffle by a l…

Class (set theory)Computer science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technologyStar (graph theory)01 natural sciencesExpressive powerTheoretical Computer ScienceRegular languageFormal language0202 electrical engineering electronic engineering information engineeringArithmeticAlgebraic numberComputingMilieux_MISCELLANEOUSDiscrete mathematicsComputer Science Applicationsshuffle operatorComputational Theory and Mathematics010201 computation theory & mathematicsProduct (mathematics)Formal language020201 artificial intelligence & image processingBoolean operations in computer-aided designWord (computer architecture)Information Systems
researchProduct

Recent results on syntactic groups of prefix codes

2012

International audience; We give a simplified presentation of groups in transformation monoids. We use this presentation to describe two recent results on syntactic groups of prefix codes. The first one uses Sturmian words to build finite bifix codes with a given permutation group as syntactic group. The second one describes a class of prefix codes such that all their syntactic groups are cyclic.

Prefix codeDiscrete mathematicsClass (set theory)Group (mathematics)010102 general mathematicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciencesPermutation group16. Peace & justice01 natural sciencesTransformation (music)Theoretical Computer SciencePrefixTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]010201 computation theory & mathematicsDiscrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsArithmeticComputer Science::Formal Languages and Automata Theory[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]MathematicsEuropean Journal of Combinatorics
researchProduct