Skip to content
<title>Channels - Register Automata with Extrema Constraints, and an Application to Two-Variable Logic :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic
Search for more channels:
Similar Items: Register Automata with Extrema Constraints, and an Application to Two-Variable Logic
Channel Options
View Record
Explore related channels
Quick Look
History-Register Automata
Quick Look
Determinisability of register and timed automata
Quick Look
Bisimilarity in fresh-register automata
Quick Look
On two-variable guarded fragment logic with expressive local Presburger constraints
Quick Look
Alternating register automata on finite words and trees
Quick Look
Two-Variable Logic with Two Order Relations
Quick Look
Data optimizations for constraint automata
Quick Look
Logic and Branching Automata
Quick Look
Visibly Tree Automata with Memory and Constraints
Quick Look
Two-variable Logic with Counting and a Linear Order
Quick Look
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
Quick Look
Two Variable vs. Linear Temporal Logic in Model Checking and Games
Quick Look
Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership
Quick Look
Automata Linear Dynamic Logic on Finite Traces
Quick Look
Logical compactness and constraint satisfaction problems
Quick Look
Register Games
Quick Look
Higher-dimensional automata modeling shared-variable systems
Quick Look
Hyper-Minimization for Deterministic Register Automata
Quick Look
Classical propositional logic and decidability of variables in intuitionistic propositional logic
Quick Look
Learning and Designing Stochastic Processes from Logical Constraints
Quick Look
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
Quick Look
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
Quick Look
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
Quick Look
Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata
Load more items
View Record
Prev
Explore related channels
Next
