A unifying Kleene Theorem for weighted finite automata

Z. Ésik, Werner Kuich

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)

Abstract

We state two variants of the Theorem of Kleene-Schützenberger: one for arbitrary semirings and proper finite automata; the other for Conway semirings and arbitrary finite automata. Considering finite automata over partial Conway semirings over an ideal, we show that these two variants are special cases of a unifying theorem.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages76-89
Number of pages14
Volume6570
DOIs
Publication statusPublished - 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6570
ISSN (Print)03029743
ISSN (Electronic)16113349

Fingerprint

Weighted Automata
Semiring
Finite Automata
Finite automata
Theorem
Arbitrary
Partial

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ésik, Z., & Kuich, W. (2011). A unifying Kleene Theorem for weighted finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6570, pp. 76-89). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6570). https://doi.org/10.1007/978-3-642-19391-0-6

A unifying Kleene Theorem for weighted finite automata. / Ésik, Z.; Kuich, Werner.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6570 2011. p. 76-89 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6570).

Research output: Chapter in Book/Report/Conference proceedingChapter

Ésik, Z & Kuich, W 2011, A unifying Kleene Theorem for weighted finite automata. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6570, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6570, pp. 76-89. https://doi.org/10.1007/978-3-642-19391-0-6
Ésik Z, Kuich W. A unifying Kleene Theorem for weighted finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6570. 2011. p. 76-89. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-19391-0-6
Ésik, Z. ; Kuich, Werner. / A unifying Kleene Theorem for weighted finite automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6570 2011. pp. 76-89 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inbook{2b35b1de692544ac8707f346f22f6ed0,
title = "A unifying Kleene Theorem for weighted finite automata",
abstract = "We state two variants of the Theorem of Kleene-Sch{\"u}tzenberger: one for arbitrary semirings and proper finite automata; the other for Conway semirings and arbitrary finite automata. Considering finite automata over partial Conway semirings over an ideal, we show that these two variants are special cases of a unifying theorem.",
author = "Z. {\'E}sik and Werner Kuich",
year = "2011",
doi = "10.1007/978-3-642-19391-0-6",
language = "English",
isbn = "9783642193903",
volume = "6570",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "76--89",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - CHAP

T1 - A unifying Kleene Theorem for weighted finite automata

AU - Ésik, Z.

AU - Kuich, Werner

PY - 2011

Y1 - 2011

N2 - We state two variants of the Theorem of Kleene-Schützenberger: one for arbitrary semirings and proper finite automata; the other for Conway semirings and arbitrary finite automata. Considering finite automata over partial Conway semirings over an ideal, we show that these two variants are special cases of a unifying theorem.

AB - We state two variants of the Theorem of Kleene-Schützenberger: one for arbitrary semirings and proper finite automata; the other for Conway semirings and arbitrary finite automata. Considering finite automata over partial Conway semirings over an ideal, we show that these two variants are special cases of a unifying theorem.

UR - http://www.scopus.com/inward/record.url?scp=79955866813&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955866813&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-19391-0-6

DO - 10.1007/978-3-642-19391-0-6

M3 - Chapter

SN - 9783642193903

VL - 6570

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 76

EP - 89

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -