Pages that link to "Item:Q3613328"
From MaRDI portal
The following pages link to Automata and Logics for Words and Trees over an Infinite Alphabet (Q3613328):
Displaying 40 items.
- Highly expressive query languages for unordered data trees (Q269323) (← links)
- Nominal monoids (Q372971) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- Symbolic tree automata (Q483051) (← links)
- Extended symbolic finite automata and transducers (Q746776) (← links)
- On notions of regularity for data languages (Q846359) (← links)
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- Containment of queries for graphs with data (Q1678169) (← links)
- On pebble automata for data languages with decidable emptiness problem (Q1959427) (← links)
- Subsequence versus substring constraints in sequence pattern languages (Q2022305) (← links)
- The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- Symbolic weighted language models, quantitative parsing and automated music transcription (Q2164736) (← links)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) (← links)
- Regular expressions for data words (Q2353403) (← links)
- Reachability in pushdown register automata (Q2396722) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- Weak and Nested Class Memory Automata (Q2799172) (← links)
- Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
- Nominal Automata for Resource Usage Control (Q2914700) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- Logics of Repeating Values on Data Trees and Branching Counter Systems (Q2988368) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- On Pebble Automata for Data Languages with Decidable Emptiness Problem (Q3182968) (← links)
- XML Schema Mappings (Q3189647) (← links)
- Dependency Tree Automata (Q3617723) (← links)
- Counting Multiplicity over Infinite Alphabets (Q3646259) (← links)
- (Q4972736) (← links)
- The Containment Problem for Unambiguous Register Automata (Q5090504) (← links)
- A Formal Framework for Complex Event Processing (Q5091115) (← links)
- (Q5092332) (← links)
- (Q5136335) (← links)
- (Q5155690) (← links)
- Deadlock Detection in Linear Recursive Programs (Q5175772) (← links)
- $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$ (Q5738989) (← links)
- Model checking usage policies (Q5740636) (← links)
- (Q5856426) (← links)
- (Q5875342) (← links)
- Synthesis of Data Word Transducers (Q5875385) (← links)
- Fast computations on ordered nominal sets (Q5918532) (← links)
