Set augmented finite automata over infinite alphabets

DOI10.1007/978-3-031-33264-7_4MaRDI QIDQ6067325zbMATH OpenOpenAlexFDO

Authors Ansuman Banerjee, Kingshuk Chatterjee, Shibashis Guha

Publication date 16 November 2023

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2311.06514

zbMATH Keywords

automata on infinite alphabetsclosure propertiesdata languagesexpressivenessregister automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Abstraction refinement for emptiness checking of alternating data automata
• Alternating register automata on finite words and trees
• An automaton over data words that captures EMSO logic
• Automata over infinite alphabets
• Class counting automata on datawords
• Context-free languages over infinite alphabets
• Finite state machines for strings over infinite alphabets
• Finite-memory automata
• scientific article; zbMATH DE number 1948151 (Why is no real title available?)
• scientific article; zbMATH DE number 6606339 (Why is no real title available?)
• Intractability of decision problems for finite-memory automata
• Langages sur des alphabets infinis
• LTL with the freeze quantifier and register automata
• On notions of regularity for data languages
• On pebble automata for data languages with decidable emptiness problem
• P Finite Automata and Regular Languages over Countably Infinite Alphabets
• Regular expressions for languages over infinite alphabets
• Space-bounded reducibility among combinatorial problems
• The reachability problem for Petri nets is not elementary
• Two-variable logic on data trees and XML reasoning
• Two-variable logic on data words
• Variable automata over infinite alphabets

This page was built for publication: Set augmented finite automata over infinite alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6067325)