Pages that link to "Item:Q2946705"

From MaRDI portal

← Graph Reachability and Pebble Automata over Infinite Alphabets (Q2946705)

Jump to:navigation, search

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to Graph Reachability and Pebble Automata over Infinite Alphabets (Q2946705):

Displaying 5 items.

On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
On pebble automata for data languages with decidable emptiness problem (Q1959427) (← links)
Subsequence versus substring constraints in sequence pattern languages (Q2022305) (← links)
On Pebble Automata for Data Languages with Decidable Emptiness Problem (Q3182968) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q2946705"