On Determinism and Unambiguity of Weighted Two-Way Automata

被引：1
|
作者：
Carnino, Vincent [1 ]
Lombardy, Sylvain [2 ]
机构：
[1] Univ Paris Est Marne la Vallee, LIGM, UMR 8049, 5 Blvd Descartes, F-77420 Champs Sur Marne, France
[2] Inst Polytech Bordeaux, LaBRI, UMR 5800, F-33405 Talence, France
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2015年 / 26卷 / 08期
关键词：
Weighted automata; two-way automata; determinization; unambiguity;
D O I：
10.1142/S0129054115400158
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper deals with one-way and two-way weighted automata. When the semiring of weights is commutative, we prove that unambiguous one-way automata, unambiguous two-way automata and deterministic two-way automata realize the same (rational) power series. If the semiring of weights is not commutative, unambiguous one-way automata and deterministic two-way automata realize the same rational power series, but unambiguous two-way automata may realize non rational power series.
引用
收藏
页码：1127 / 1146
页数：20
相关论文
共 50 条
  • [31] Partially Ordered Two-Way Buchi Automata
    Kufleitner, Manfred
    Lauser, Alexander
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2011, 6482 : 181 - 190
  • [32] Multihead two-way probabilistic finite automata
    Macarie, II
    THEORY OF COMPUTING SYSTEMS, 1997, 30 (01) : 91 - 109
  • [33] Improved complement for two-way alternating automata
    Viliam Geffert
    Christos A. Kapoutsis
    Mohammad Zakzok
    Acta Informatica, 2022, 59 : 619 - 669
  • [34] Multihead two-way probabilistic finite automata
    Department of Computer Science, SUNY Geneseo, Geneseo, NY 14454, United States
    不详
    Theory Comput. Syst., 1 (91-109):
  • [35] Multihead two-way probabilistic finite automata
    I. I. Macarie
    Theory of Computing Systems, 1997, 30 : 91 - 109
  • [36] Reasoning about the past with two-way automata
    Vardi, MY
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1998, 1443 : 628 - 641
  • [37] Improved complement for two-way alternating automata
    Geffert, Viliam
    Kapoutsis, Christos A.
    Zakzok, Mohammad
    ACTA INFORMATICA, 2022, 59 (05) : 619 - 669
  • [38] Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata
    Geffert, Viliam
    Okhotin, Alexander
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 291 - +
  • [39] Two-Way Automata over Locally Finite Semirings
    Dando, Louis-Marie
    Lombardy, Sylvain
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 62 - 74
  • [40] Longer Shortest Strings in Two-Way Finite Automata
    Krymski, Stanislav
    Okhotin, Alexander
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2020, 2020, 12442 : 104 - 116
12345