On notions of regularity for data languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1948151 (Why is no real title available?)
- An algebraic approach to data languages and timed languages
- Automata and Logics for Words and Trees over an Infinite Alphabet
- CONCUR 2004 - Concurrency Theory
- Computing and Combinatorics
- Finite state machines for strings over infinite alphabets
- Finite-memory automata
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Inconsistency Tolerance
- Intractability of decision problems for finite-memory automata
- On Reasoning About Rings
- Parametrized complexity theory.
Cited in
(26)- Leafy automata for higher-order concurrency
- scientific article; zbMATH DE number 1834677 (Why is no real title available?)
- On temporal logics with data variable quantifications: decidability and complexity
- Set augmented finite automata over infinite alphabets
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Streamable regular transductions
- Reasoning on data words over numeric domains
- Automata and Logics for Concurrent Systems: Five Models in Five Pages
- Reachability in pushdown register automata
- Learning Tree Languages
- Learning Transparent Data Automata
- Regular expressions for data words
- On Notions of Regularity for Data Languages
- Round- and context-bounded control of dynamic pushdown systems
- An Algebraic Approach to Regular Sets
- Walking on data words
- Regular expressions for data words
- Communicating finite-state machines and two-variable logic
- Weak and nested class memory automata
- An automaton over data words that captures EMSO logic
- ML and extended branching VASS
- A little bit infinite? On adding data to finitely labelled structures
- A succinct canonical register automaton model
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory
- Regular Programming for Quantitative Properties of Data Streams
- Finite state machines for strings over infinite alphabets
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 Q846359)
