On Notions of Regularity for Data Languages

DOI10.1007/978-3-540-74240-1_9MaRDI QIDQ5444950zbMATH OpenOpenAlexFDO

Authors Henrik Björklund, Thomas Schwentick

Publication date 26 February 2008

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74240-1_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On notions of regularity for data languages
• scientific article; zbMATH DE number 3874640
• scientific article; zbMATH DE number 2086254
• On decidability of regular languages theories
• scientific article; zbMATH DE number 611232
• On the boundary of regular languages
• On the boundary of regular languages
• On decidability of theories of regular languages
• scientific article; zbMATH DE number 3917732
• scientific article; zbMATH DE number 3862471

Cited in

(15)

• On pebble automata for data languages with decidable emptiness problem
• Regular expressions for data words
• Regular Programming for Quantitative Properties of Data Streams
• Regular expressions for data words
• ML and extended branching VASS
• On Pebble Automata for Data Languages with Decidable Emptiness Problem
• Automata on Gauss Words
• Algorithmic Analysis of Array-Accessing Programs
• Counting Multiplicity over Infinite Alphabets
• scientific article; zbMATH DE number 1834677 (Why is no real title available?)
• Finite state machines for strings over infinite alphabets
• An Algebraic Approach to Regular Sets
• Reachability in distributed memory automata
• On notions of regularity for data languages
• Model checking memoryful linear-time logics over one-counter automata

This page was built for publication: On Notions of Regularity for Data Languages

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