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 条

[21] Program comprehension using information retrieval and probabilistic finite-state automata
Chen, Hua
Wang, Can
Chen, Chun
Tang, Wen-Bin
Qian, Jian-Fei
Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science), 2008, 42 (12): : 2108 - 2111
[22] Human Activity Discovery and Recognition Using Probabilistic Finite-State Automata
Viard, Kevin
Fanti, Maria Pia
Faraut, Gregory
Lesage, Jean-Jacques
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2020, 17 (04) : 2085 - 2096
[23] A ground-complete axiomatisation of finite-state processes in a generic process algebra
Baeten, Jos C. M.
Bravetti, Mario
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2008, 18 (06) : 1057 - 1089
[24] An Evolution Strategy for the Induction of Fuzzy Finite-State Automata
万敏
莫智文
Journal of Electronic Science and Technology of China, 2005, (03) : 284 - 287
[25] An approximate determinization algorithm for weighted finite-state automata
Buchsbaum, AL
Giancarlo, R
Westbrook, JR
ALGORITHMICA, 2001, 30 (04) : 503 - 526
[26] FSA utilities: A toolbox to manipulate finite-state automata
van Noord, G
AUTOMATA IMPLEMENTATION, 1997, 1260 : 87 - 108
[27] Random Generation of Nondeterministic Finite-State Tree Automata
Hanneforth, Thomas
Maletti, Andreas
Quernheim, Daniel
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (134): : 11 - 16
[28] An evolution strategy for the induction of fuzzy finite-state automata
Mo, ZW
Wan, M
Shu, L
2005 IEEE International Conference on Granular Computing, Vols 1 and 2, 2005, : 579 - 582
[29] Incremental construction and maintenance of minimal finite-state automata
Carrasco, RC
Forcada, ML
COMPUTATIONAL LINGUISTICS, 2002, 28 (02) : 207 - 216
[30] PRONUNCIATION MODELING Automatic Learning of Finite-state Automata
Pastor, Moises
Casacuberta, Francisco
INTEGRATION OF PHONETIC KNOWLEDGE IN SPEECH TECHNOLOGY, 2005, 25 : 133 - 148

← 1 2 3 4 5 →