Bounded languages over infinite alphabets

DOI10.1007/978-3-031-86319-6_15MaRDI QIDQ7236642zbMATH OpenFDO

Authors Yoav Danieli, Michael Kaminski

Publication date 29 April 2026

Full work available at URL https://doi.org/10.1007/978-3-031-86319-6_15

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Combinatorics (05-XX) Computer science (68-XX)

Cites work

• A note on the emptiness problem for alternating finite-memory automata
• Closure under reversal of languages over infinite alphabets
• Finite state machines for strings over infinite alphabets
• Finite-memory automata
• scientific article; zbMATH DE number 1834677 (Why is no real title available?)
• scientific article; zbMATH DE number 7354705 (Why is no real title available?)
• LTL with the freeze quantifier and register automata
• On pebble automata for data languages with decidable emptiness problem
• On Pebble Automata for Data Languages with Decidable Emptiness Problem
• Parallel program schemata
• Sur les correspondances multivoques des ensembles.

This page was built for publication: Bounded languages over infinite alphabets

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