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 条
  • [21] Converting two-way nondeterministic unary automata into simpler automata
    Geffert, V
    Mereghetti, C
    Pighizzini, G
    THEORETICAL COMPUTER SCIENCE, 2003, 295 (1-3) : 189 - 203
  • [22] Two-way alternating automata and finite models
    Bojanczyk, M
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 833 - 844
  • [23] A class of two-way fuzzy finite automata
    2013, ICIC Express Letters Office, Tokai University, Kumamoto Campus, 9-1-1, Toroku, Kumamoto, 862-8652, Japan (07):
  • [24] Two-way deterministic automata with jumping mode
    Fazekas, Szilard Zsolt
    Hoshi, Kaito
    Yamamura, Akihiro
    THEORETICAL COMPUTER SCIENCE, 2021, 864 : 92 - 102
  • [25] Two-Way Automata Versus Logarithmic Space
    Kapoutsis, Christos A.
    THEORY OF COMPUTING SYSTEMS, 2014, 55 (02) : 421 - 447
  • [26] Two-Way Visibly Pushdown Automata and Transducers
    Dartois, Luc
    Filiot, Emmanuel
    Reynier, Pierre-Alain
    Talbot, Jean-Marc
    PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 217 - 226
  • [27] Size Complexity of Two-Way Finite Automata
    Kapoutsis, Christos A.
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2009, 5583 : 47 - 66
  • [28] Simulation of Two-Way Pushdown Automata Revisited
    Glueck, Robert
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (129): : 250 - 258
  • [29] PARTIALLY ORDERED TWO-WAY BUCHI AUTOMATA
    Kufleitner, Manfred
    Lauser, Alexander
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2011, 22 (08) : 1861 - 1876
  • [30] Two-Way Automata Versus Logarithmic Space
    Christos A. Kapoutsis
    Theory of Computing Systems, 2014, 55 : 421 - 447
12345