Skip to content
<title>Channels - Weighted Logics for Nested Words and Algebraic Formal Power Series :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Weighted Logics for Nested Words and Algebraic Formal Power Series
Search for more channels:
Similar Items: Weighted Logics for Nested Words and Algebraic Formal Power Series
Channel Options
View Record
Explore related channels
Quick Look
First-Order and Temporal Logics for Nested Words
Quick Look
Regular Cost Functions, Part I: Logic and Algebra over Words
Quick Look
Streamability of nested word transductions
Quick Look
Formal Theories for Linear Algebra
Quick Look
On Nested Sequents for Constructive Modal Logics
Quick Look
Formalized linear algebra over Elementary Divisor Rings in Coq
Quick Look
Positive First-order Logic on Words and Graphs
Quick Look
Algebraic and logical descriptions of generalized trees
Quick Look
Logical and Algebraic Characterizations of Rational Transductions
Quick Look
Logic Meets Algebra: the Case of Regular Languages
Quick Look
Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
Quick Look
On the decidability and complexity of Metric Temporal Logic over finite words
Quick Look
Untyping Typed Algebras and Colouring Cyclic Linear Logic
Quick Look
Wreath Products of Forest Algebras, with Applications to Tree Logics
Quick Look
The Power-Set Construction for Tree Algebras
Quick Look
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
Quick Look
Distribution Bisimilarity via the Power of Convex Algebras
Quick Look
CC-circuits and the expressive power of nilpotent algebras
Quick Look
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
Quick Look
Time2Graph: Dual Embedding and Nested-Graph Transformation for Performance Enhancement in Time Series Classification
Quick Look
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
Quick Look
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
Quick Look
Formal Languages, Formally and Coinductively
Quick Look
Formal Design of Asynchronous Fault Detection and Identification Components using Temporal Epistemic Logic
Load more items
View Record
Prev
Explore related channels
Next
