Set Augmented Finite Automata over Infinite Alphabets

Authors

Ansuman Banerjee, Indian Statistical Institute, Kolkata
Kingshuk Chatterjee, Government College of Engineering & Ceramic Technology
Shibashis Guha, Tata Institute of Fundamental Research, Mumbai

Document Type

Conference Article

Publication Title

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

Abstract

A data language is set of finite words defined on an infinite alphabet. Data languages are used to express properties associated with data values (domain defined over a countably infinite set). In this paper, we introduce set augmented finite automata (SAFA), a new class of automata for expressing data languages. SAFA is able to recognize data languages while storing a few data values in most cases. We investigate nonemptiness, membership, closure properties, and expressiveness of SAFA.

First Page

36

Last Page

50

DOI

10.1007/978-3-031-33264-7_4

Publication Date

1-1-2023

Comments

Open Access, Green

Recommended Citation

Banerjee, Ansuman; Chatterjee, Kingshuk; and Guha, Shibashis, "Set Augmented Finite Automata over Infinite Alphabets" (2023). Conference Articles. 606.
https://digitalcommons.isical.ac.in/conf-articles/606