THE VALIDITY OF WEIGHTED AUTOMATA

Author:

LOMBARDY SYLVAIN1,SAKAROVITCH JACQUES2

Affiliation:

1. LaBRI, Institut Polytechnique de Bordeaux — Université de Bordeaux, 351 cours de la Libération, 33405 Talence, France

2. LTCI, CNRS/Telecom ParisTech, 46 rue Barrault, 75013 Paris, France

Abstract

This paper addresses the problem of the validity of weighted automata in which the presence of ε-circuits results in infinite summations. Earlier works either rule out such automata or characterize the semirings in which these infinite sums are all well-defined. By means of a topological approach, we take here a definition of validity that is strong enough to insure that in any kind of semirings, any closure algorithm will succeed on every valid weighted automaton and turn it into an equivalent proper automaton. This definition is stable with respect to natural transformations of automata. The classical closure algorithms, in particular algorithms based on the computation of the star of the matrix of ε-transitions, cannot be used to decide validity. This decision problem remains open for general topological semirings. We present a closure algorithm that yields a decision procedure for the validity of automata in the case where the weights are taken in ℚ or ℝ, two cases that had never been treated before. These algorithm and procedure are implemented in the VAUCANSON platform.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

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

1. The Net Automaton of a Rational Expression;LATIN 2022: Theoretical Informatics;2022

2. The Validity of Weighted Automata;Implementation and Application of Automata;2018

3. Derived-Term Automata of Multitape Expressions with Composition;Scientific Annals of Computer Science;2017

4. Derived-Term Automata of Weighted Rational Expressions with Quotient Operators;Theoretical Aspects of Computing – ICTAC 2017;2017

5. On Determinism and Unambiguity of Weighted Two-Way Automata;International Journal of Foundations of Computer Science;2015-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3