⚙ Automata Theory - matmat · Scour

A Theory of Hanoi Omega-Automata and Games 🎯Automata theory

std::__detail::_Automaton (3) Linux Manual Page 🎯Automata theory

systutorials.com·23h

Document type inference 🎯Gradual Typing

Automaton-based Characterisations of First Order Logic over Infinite Trees 🎯Automata theory

Decomposition of Automata recognizing Ideals ⚙️Syntactic Monoids

Complexity Classes Arising from Circuits over Finite Algebraic Structures 🎞️Tape Combinatorics

An Effective Orchestral Approach to Satisfiability Modulo Prime Fields 🧮Constraint SMT

An algebraic characterisation of Eve-positional languages 🎯Automata theory

Minimum Reachability Probabilities in Rectangular Automata with Random Clocks 🎯Automata theory

Subword enumeration up to stack-sorting equivalence 🌳Trie Structures

Common Foundations for Recursive Shape Languages 🔤Type Theory

Benchmarking Testing in Automated Theorem Proving ✓Automated Theorem Proving

The Root Theorem of Context Engineering 🌳Context free grammars

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs 📐Binary Grammars

An Information-Geometric Framework for Stability Analysis of Large Language Models under Entropic Stress 🧮Kolmogorov Bounds

On first-order model checking parameterized by the number of variables 👑Coq Tactics

From Coalgebraic Determinization to Belief Construction for Partial Observability 👑Coq Tactics

Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs 🎯Performance Proofs

Characterizing LTL Formulas by Examples ⚔️Lean Tactics

AutoPyVerifier: Learning Compact Executable Verifiers for Large Language Model Outputs 🎯Dependent Parsing

No more posts from matmat's subscribed feeds.

Scour all 24432 feeds Learn more about Feeds

Log in to enable infinite scrolling