Set Augmented Finite Automata over Infinite Alphabets

Ansuman Banerjee,Kingshuk Chatterjee,Shibashis Guha

Developments in Language Theory（2023）

Cited 0|Views0

No score

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.

Translated text

Key words

Automata on infinite alphabets, data languages, Register automata, Expressiveness, Closure properties

AI Read Science

Must-Reading Tree

Example

Generate MRT to find the research sequence of this paper

Chat Paper

Summary is being generated by the instructions you defined