Skip to content
<title>Channels - Computability of Data-Word Transductions over Different Data Domains :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Computability of Data-Word Transductions over Different Data Domains
Search for more channels:
Similar Items: Computability of Data-Word Transductions over Different Data Domains
Channel Options
View Record
Explore related channels
Quick Look
Streamability of nested word transductions
Quick Look
Path Checking for MTL and TPTL over Data Words
Quick Look
Synthesis of Data Word Transducers
Quick Look
On the Monadic Second-Order Transduction Hierarchy
Quick Look
Logical and Algebraic Characterizations of Rational Transductions
Quick Look
On first-order transductions of classes of graphs
Quick Look
Playing with Repetitions in Data Words Using Energy Games
Quick Look
Refined Risk Bounds for Unbounded Losses via Transductive Priors
Quick Look
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
Quick Look
Synthesis of Computable Regular Functions of Infinite Words
Quick Look
On the decidability and complexity of Metric Temporal Logic over finite words
Quick Look
Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture
Quick Look
Regular Cost Functions, Part I: Logic and Algebra over Words
Quick Look
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
Quick Look
Transfinite Lyndon words
Quick Look
Decidability for Sturmian words
Quick Look
Source Data Selection for Brain–Computer Interfaces Based on Simple Features
Quick Look
Boundedness in languages of infinite words
Quick Look
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
Quick Look
"What is Different Between These Datasets?" A Framework for Explaining Data Distribution Shifts
Quick Look
RealPaver 1.1: A C++ Library for Constraint Programming over Numeric or Mixed Discrete-Continuous Domains
Quick Look
First-Order and Temporal Logics for Nested Words
Quick Look
Alternating register automata on finite words and trees
Quick Look
Positive First-order Logic on Words and Graphs
Load more items
View Record
Prev
Explore related channels
Next
