A FINITE AXIOMATISATION OF FINITE-STATE AUTOMATA USING STRING DIAGRAMS

被引：0

作者：

Piedeleu, Robin ^{[1
]}

Zanasi, Fabio ^{[1
,2
]}

机构：

[1] UCL, London, England

[2] Univ Bologna, Bologna, Italy

来源：

LOGICAL METHODS IN COMPUTER SCIENCE | 2023年 / 19卷 / 01期

关键词：

string diagrams; finite-state automata; symmetric monoidal category; complete axiomatisation; ALGEBRA;

D O I：

10.46298/LMCS-19(1:13)2023

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a complete equational theory for language equivalence, with two notable features. First, the proposed axiomatisation is finite. Second, the Kleene star is a derived concept, as it can be decomposed into more primitive algebraic blocks.

引用

页数：38

共 50 条

[41] Finite-state registered automata and their uses in natural languages
Cohen-Sygal, Yael
Wintner, Shuly
FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2006, 4002 : 43 - +
[42] TRANSFORMATION OF STATE DIAGRAMS BY STATE CHARACTERISTIC EQUATIONS OF FINITE AUTOMATA
UDAGAWA, K
TANGE, H
ELECTRONICS & COMMUNICATIONS IN JAPAN, 1965, 48 (12): : 48 - &
[43] Initial-and-Final-State Detectability of Nondeterministic Finite-State Automata
Shen, Liren
Miao, Shaowen
Lai, Aiwen
Jan Komenda
Lahaye, Sebastien
2024 14TH ASIAN CONTROL CONFERENCE, ASCC 2024, 2024, : 509 - 514
[44] FINITE-STATE AUTOMATA FROM REGULAR EXPRESSION-TREES
GOLDBERG, RR
COMPUTER JOURNAL, 1993, 36 (07): : 623 - 630
[45] Obtaining shorter regular expressions from finite-state automata
Han, Yo-Sub
Wood, Derick
THEORETICAL COMPUTER SCIENCE, 2007, 370 (1-3) : 110 - 120
[46] ON A CLASS OF TIMER HYBRID SYSTEMS REDUCIBLE TO FINITE-STATE AUTOMATA
INAN, K
DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 1995, 5 (01): : 83 - 96
[47] Recurrent Neural Language Models as Probabilistic Finite-state Automata
Svete, Anej
Cotterell, Ryan
2023 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING, EMNLP 2023, 2023, : 8069 - 8086
[48] Finite-state registered automata for non-concatenative morphology
Cohen-Sygal, Yael
Wintner, Shuly
COMPUTATIONAL LINGUISTICS, 2006, 32 (01) : 49 - 82
[49] Simpler and more general minimization for weighted finite-state automata
Eisner, J
HLT-NAACL 2003: HUMAN LANGUAGE TECHNOLOGY CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE MAIN CONFERENCE, 2003, : 64 - 71
[50] Recognition of Human Activity Based on Probabilistic Finite-State Automata
Viard, K.
Fanti, M. P.
Faraut, G.
Lesage, J-J
2017 22ND IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2017,

← 1 2 3 4 5 →