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 条

[31] An Approximate Determinization Algorithm for Weighted Finite-State Automata
A. L. Buchsbaum
R. Giancarlo
J. R. Westbrook
Algorithmica, 2001, 30 : 503 - 526
[32] Indistinguishability of finite-state automata with respect to some environments
Kurganskii A.N.
Cybernetics and Systems Analysis, 2001, 37 (1) : 33 - 41
[33] A GEOMETRICAL VIEW OF THE DETERMINIZATION AND MINIMIZATION OF FINITE-STATE AUTOMATA
COURCELLE, B
NIWINSKI, D
PODELSKI, A
MATHEMATICAL SYSTEMS THEORY, 1991, 24 (02): : 117 - 146
[34] On a Class of High-Level Finite-State Automata
Vinogradov, R. A.
Sokolov, V. A.
AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2010, 44 (07) : 398 - 406
[35] An Efficient Parallel Determinisation Algorithm for Finite-state Automata
Hanneforth, Thomas
Watson, Bruce W.
PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012, 2012, : 42 - 52
[36] Methods of constructing universal tests for finite-state automata
V. A. Tverdokhlebov
Automation and Remote Control, 2005, 66 (1) : 139 - 147
[37] Shorter regular expressions from finite-state automata
Han, YS
Wood, D
IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 141 - 152
[38] Compression of finite-state automata through failure transitions
Bjorklund, Henrik
Bjorklund, Johanna
Zechner, Niklas
THEORETICAL COMPUTER SCIENCE, 2014, 557 : 87 - 100
[39] Methods of constructing universal tests for finite-state automata
Tverdokhlebov, VA
AUTOMATION AND REMOTE CONTROL, 2005, 66 (01) : 139 - 147
[40] Incremental construction of minimal acyclic finite-state automata
Daciuk, J
Mihov, S
Watson, BW
Watson, RE
COMPUTATIONAL LINGUISTICS, 2000, 26 (01) : 3 - 16

← 1 2 3 4 5 →