LAZARD'S ELIMINATION (IN TRACES) IS FINITE-STATE RECOGNIZABLE-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

LAZARD'S ELIMINATION (IN TRACES) IS FINITE-STATE RECOGNIZABLE

Published:2007-02 Issue:01 Volume:17 Page:53-60
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

DUCHAMP GÉRARD¹,LUQUE JEAN-GABRIEL²

Affiliation:

1. Laboratoire d'Informatique de Paris Nord, Université Paris 13 (LIPN UMR 7030 du CNRS), Avenue J.-B. Clément 93430 Villetaneuse, France

2. Laboratoire d'informatique de l'Institut Gaspard, Monge (UMR 8049 IGM-LabInfo), Université de Marne-la-Vallée, 5, Boulevard Descartes, 775454 Champs-sur-Marne, France

Abstract

We prove that the codes issued from the elimination of any sub-alphabet in a trace monoid are finite-state recognizable. This implies in particular that the transitive factorizations of the trace monoids are recognizable by (boolean) finite-state automata.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196707003433

Reference9 articles.

1. Pure and Applied Mathematics;Berstel J.,1995

2. Lecture Notes In Mathematics;Cartier P.,1969

3. Combinatorics in Trace Monoids II

4. Transitive factorizations of free partially commutative monoids and Lie algebras

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP