Skip to content
<title>Channels - Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners
Search for more channels:
Similar Items: Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners
Channel Options
View Record
Explore related channels
Quick Look
A composite wheel spanner
Quick Look
A dynamic $(1+varepsilon)$-spanner for disk intersection graphs
Quick Look
A coalgebraic take on regular and $omega$-regular behaviours
Quick Look
RegularizedOptimization.jl: A Julia framework for regularized and nonsmooth optimization
Quick Look
Continuous Regular Functions
Quick Look
Regular Tree Algebras
Quick Look
Foundations of regular coinduction
Quick Look
Regular Model Checking Upside-Down: An Invariant-Based Approach
Quick Look
Computably regular topological spaces
Quick Look
Fractals from Regular Behaviours
Quick Look
A Trichotomy for Regular Trail Queries
Quick Look
Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
Quick Look
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
Quick Look
Width and size of regular resolution proofs
Quick Look
Degrees of Lookahead in Regular Infinite Games
Quick Look
Regular Separability of One Counter Automata
Quick Look
Regular matching problems for infinite trees
Quick Look
A survey on difference hierarchies of regular languages
Quick Look
Aczel-Mendler Bisimulations in a Regular Category
Quick Look
Logic Meets Algebra: the Case of Regular Languages
Quick Look
Algorithms for Omega-Regular Games with Imperfect Information
Quick Look
Linear Temporal Logic for Regular Cost Functions
Quick Look
Separating Regular Languages with First-Order Logic
Quick Look
Families of DFAs as Acceptors of $omega$-Regular Languages
Load more items
View Record
Prev
Explore related channels
Next
