Codes et sous-monoides possedant des mots neutres-Reference-Cited by-同舟云学术

Codes et sous-monoides possedant des mots neutres

Published:1977 Issue: Volume: Page:270-281
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Perrin D.,Schützenberger M. -P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-08138-0_23.pdf

Reference9 articles.

1. BERSTEL, J.— Sur la densité asymptotique des langages formels, in Automata Languages and Programming (M. Nivat ed.) North Holland (1972) 345–58.

2. BOE, J.M.— Représentations des monoides: applications à la théorie des codes, Thèse de 3ème cycle, Univ. des Sciences et Techniques du Languedoc (1976).

3. BOE, J.M., BOYAT, J. CESARI, Y., LACHENY, A. et M. VINCENT, Automates et monoides syntaxiques des sous-monoides libres, à paraître dans Information and Control.

4. EILENBERG, S.— Automata, Languages and Machines, Vol. A, Academic Press (1974).

5. LALLEMENT, G.— On regular semigroups as syntactic monoids of prefix codes, à paraître dans Theoretical Computer Science.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Note with Computer Exploration on the Triangle Conjecture;Language and Automata Theory and Applications;2019

2. FINITE COMPLETIONS VIA FACTORIZING CODES;International Journal of Algebra and Computation;2007-06

3. ON A PROPERTY OF THE FACTORIZING CODES;International Journal of Algebra and Computation;1999-06

4. Obituary - Marcel-Paul Schützenberger (1920–1996);Semigroup Forum;1997-09

5. Expletives in languages and middle units in semigroups;Semigroup Forum;1989-12