Pages that link to "Item:Q2946705"

From MaRDI portal

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

Jump to:navigation, search

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

Displaying 2 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)

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