Skip to content
<title>Channels - Computing with Infinite Objects: the Gray Code Case :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Computing with Infinite Objects: the Gray Code Case
Search for more channels:
Similar Items: Computing with Infinite Objects: the Gray Code Case
Channel Options
View Record
Explore related channels
Quick Look
The Complexity of Infinite Computations In Models of Set Theory
Quick Look
Synthesis of Computable Regular Functions of Infinite Words
Quick Look
Infinite and Bi-infinite Words with Decidable Monadic Theories
Quick Look
On Sessions and Infinite Data
Quick Look
Infinite Probabilistic Databases
Quick Look
Infinite sequential Nash equilibrium
Quick Look
Boundedness in languages of infinite words
Quick Look
Characterising memory in infinite games
Quick Look
The Expansion Problem for Infinite Trees
Quick Look
Power of Randomization in Automata on Infinite Strings
Quick Look
Degrees of Lookahead in Regular Infinite Games
Quick Look
Modeling and Verification of Infinite Systems with Resources
Quick Look
Coalgebraic Infinite Traces and Kleisli Simulations
Quick Look
Regular matching problems for infinite trees
Quick Look
Reinforcement Learning for Infinite-Dimensional Systems
Quick Look
Positional Determinacy of Games with Infinitely Many Priorities
Quick Look
Determinacy in Discrete-Bidding Infinite-Duration Games
Quick Look
Ambiguity Hierarchy of Regular Infinite Tree Languages
Quick Look
The Theory of Universal Graphs for Infinite Duration Games
Quick Look
Model Checking Synchronized Products of Infinite Transition Systems
Quick Look
How Much Lookahead is Needed to Win Infinite Games?
Quick Look
Reachability for infinite time Turing machines with long tapes
Quick Look
A Functional (Monadic) Second-Order Theory of Infinite Trees
Quick Look
Infinite-dimensional Mahalanobis Distance with Applications to Kernelized Novelty Detection
Load more items
View Record
Prev
Explore related channels
Next
