Set augmented finite automata over infinite alphabets
From MaRDI portal
Publication:6067325
DOI10.1007/978-3-031-33264-7_4arXiv2311.06514OpenAlexW4377081463MaRDI QIDQ6067325
Shibashis Guha, Kingshuk Chatterjee, Ansuman Banerjee
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
Cites Work
- On notions of regularity for data languages
- Langages sur des alphabets infinis
- Space-bounded reducibility among combinatorial problems
- Finite-memory automata
- Context-free languages over infinite alphabets
- Intractability of decision problems for finite-memory automata
- On pebble automata for data languages with decidable emptiness problem
- Abstraction refinement for emptiness checking of alternating data automata
- Alternating register automata on finite words and trees
- LTL with the freeze quantifier and register automata
- Two-variable logic on data words
- CLASS COUNTING AUTOMATA ON DATAWORDS
- An Automaton over Data Words That Captures EMSO Logic
- Two-variable logic on data trees and XML reasoning
- Variable Automata over Infinite Alphabets
- P Finite Automata and Regular Languages over Countably Infinite Alphabets
- Automata over Infinite Alphabets
- The reachability problem for Petri nets is not elementary
- Finite state machines for strings over infinite alphabets
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Set augmented finite automata over infinite alphabets
