On notions of regularity for data languages
From MaRDI portal
Publication:846359
DOI10.1016/J.TCS.2009.10.009zbMATH Open1183.68240OpenAlexW2163310156MaRDI QIDQ846359FDOQ846359
Authors: Henrik Björklund, Thomas Schwentick 
Publication date: 9 February 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.009
Recommendations
Cites Work
- Title not available (Why is that?)
- Parametrized complexity theory.
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Finite-memory automata
- On Reasoning About Rings
- An algebraic approach to data languages and timed languages
- Finite state machines for strings over infinite alphabets
- Intractability of decision problems for finite-memory automata
- CONCUR 2004 - Concurrency Theory
- Computing and Combinatorics
- Inconsistency Tolerance
Cited In (26)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- On Notions of Regularity for Data Languages
- Round- and context-bounded control of dynamic pushdown systems
- Weak and nested class memory automata
- ML and extended branching VASS
- A little bit infinite? On adding data to finitely labelled structures
- Regular Programming for Quantitative Properties of Data Streams
- Regular expressions for data words
- Reachability in pushdown register automata
- An automaton over data words that captures EMSO logic
- Automata and Logics for Concurrent Systems: Five Models in Five Pages
- Finite state machines for strings over infinite alphabets
- Set augmented finite automata over infinite alphabets
- Streamable regular transductions
- Learning Transparent Data Automata
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory
- A succinct canonical register automaton model
- Leafy automata for higher-order concurrency
- Title not available (Why is that?)
- On temporal logics with data variable quantifications: decidability and complexity
- Learning Tree Languages
- Reasoning on data words over numeric domains
- Regular expressions for data words
- An Algebraic Approach to Regular Sets
- Walking on data words
- Communicating finite-state machines and two-variable logic
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)
