CLASS COUNTING AUTOMATA ON DATAWORDS

DOI10.1142/S0129054111008465zbMath1216.68149OpenAlexW2042626632MaRDI QIDQ3016221

No author found.

Publication date: 14 July 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111008465

zbMATH Keywords

decidabilityautomata on infinite alphabetdataword

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

On temporal logics with data variable quantifications: decidability and complexity ⋮ Set augmented finite automata over infinite alphabets

Cites Work

• Classes of regular and context-free languages over countably infinite alphabets
• Langages sur des alphabets infinis
• Finite-memory automata
• A logical characterization of data languages.
• Finite state machines for strings over infinite alphabets

This page was built for publication: CLASS COUNTING AUTOMATA ON DATAWORDS