Skip to content
<title>Channels - Synthesis of Computable Regular Functions of Infinite Words :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Synthesis of Computable Regular Functions of Infinite Words
Search for more channels:
Similar Items: Synthesis of Computable Regular Functions of Infinite Words
Channel Options
View Record
Explore related channels
Quick Look
Infinite and Bi-infinite Words with Decidable Monadic Theories
Quick Look
Boundedness in languages of infinite words
Quick Look
Regular matching problems for infinite trees
Quick Look
Degrees of Lookahead in Regular Infinite Games
Quick Look
Regular Cost Functions, Part I: Logic and Algebra over Words
Quick Look
Synthesis of Data Word Transducers
Quick Look
Ambiguity Hierarchy of Regular Infinite Tree Languages
Quick Look
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
Quick Look
The Complexity of Infinite Computations In Models of Set Theory
Quick Look
Computing with Infinite Objects: the Gray Code Case
Quick Look
Computably regular topological spaces
Quick Look
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
Quick Look
Continuous Regular Functions
Quick Look
A Functional (Monadic) Second-Order Theory of Infinite Trees
Quick Look
Computability of Data-Word Transductions over Different Data Domains
Quick Look
Infinite Probabilistic Databases
Quick Look
On Sessions and Infinite Data
Quick Look
Linear Temporal Logic for Regular Cost Functions
Quick Look
Measure Many Quantum Finite Automata on Infinite Words
Quick Look
Transfer Function Synthesis without Quantifier Elimination
Quick Look
Infinite sequential Nash equilibrium
Quick Look
Characterising memory in infinite games
Quick Look
The Expansion Problem for Infinite Trees
Quick Look
Transfinite Lyndon words
Load more items
View Record
Prev
Explore related channels
Next
