On notions of regularity for data languages
From MaRDI portal
Publication:846359
DOI10.1016/j.tcs.2009.10.009zbMath1183.68240OpenAlexW2163310156MaRDI QIDQ846359
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
Related Items (17)
On temporal logics with data variable quantifications: decidability and complexity ⋮ Reachability in pushdown register automata ⋮ Layered memory automata: recognizers for quasi-regular languages with unbounded memory ⋮ Communicating Finite-State Machines and Two-Variable Logic ⋮ Automata and Logics for Concurrent Systems: Five Models in Five Pages ⋮ Set augmented finite automata over infinite alphabets ⋮ Learning Tree Languages ⋮ Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ ML and Extended Branching VASS ⋮ A succinct canonical register automaton model ⋮ Leafy automata for higher-order concurrency ⋮ Walking on data words ⋮ Learning Transparent Data Automata ⋮ Weak and Nested Class Memory Automata ⋮ Streamable regular transductions ⋮ Regular Programming for Quantitative Properties of Data Streams ⋮ An Automaton over Data Words That Captures EMSO Logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Finite-memory automata
- An algebraic approach to data languages and timed languages
- Intractability of decision problems for finite-memory automata
- Parametrized complexity theory.
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Computing and Combinatorics
- Finite state machines for strings over infinite alphabets
- CONCUR 2004 - Concurrency Theory
- Inconsistency Tolerance
- On Reasoning About Rings
This page was built for publication: On notions of regularity for data languages
