Monoidal-closed categories of tree automata
From MaRDI portal
Publication:5220183
categorical logicCurry-Howard correspondencelinear logicmonadic second-order logicautomata on infinite trees
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Logic in computer science (03B70) Categorical logic, topoi (03G30) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Categories of machines, automata (18B20) Categorical aspects of linear logic (18M45)
Recommendations
Cites work
- scientific article; zbMATH DE number 5872401 (Why is no real title available?)
- scientific article; zbMATH DE number 3940199 (Why is no real title available?)
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 4104952 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- scientific article; zbMATH DE number 1215497 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 1241697 (Why is no real title available?)
- scientific article; zbMATH DE number 1241700 (Why is no real title available?)
- scientific article; zbMATH DE number 1332657 (Why is no real title available?)
- scientific article; zbMATH DE number 1497810 (Why is no real title available?)
- scientific article; zbMATH DE number 1882496 (Why is no real title available?)
- scientific article; zbMATH DE number 7147442 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- A Dialectica-like interpretation of a linear MSO on infinite words
- A Fibrational Account of Local States
- A theory of sequentiality
- Alternating automata on infinite trees
- Ambiguous classes in \(\mu\)-calculi hierarchies
- An Explicit Formula for the Free Exponential Modality of Linear Logic
- An algebraic proof of Rabin's tree theorem
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Asynchronous games. II: The true concurrency of innocence
- Automata, logics, and infinite games. A guide to current research
- Categorical logic and type theory
- Categorical semantics of linear logic
- Choice functions and well-orderings over the infinite binary tree
- Comparing hierarchies of types in models of linear logic
- Continuous separation of game languages
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Determinization and memoryless winning strategies
- Fibrations of tree automata
- First steps in synthetic guarded domain theory: step-indexing in the topos of trees
- Glueing and orthogonality for models of linear logic
- Higher-order parity automata
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Innocent strategies as presheaves and interactive equivalences for CCS
- LMSO: a Curry-Howard approach to Church's synthesis via linear logic
- Lectures on the Curry-Howard isomorphism
- MSO on the Infinite Binary Tree: Choice and Order
- Monadic second-order logic on tree-like structures
- Monoidal-closed categories of tree automata
- Nondeterminism in game semantics via sheaves
- On dialogue games and coherent strategies
- On full abstraction for PCF: I, II and III
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Proof theory in the abstract
- Rabin's uniformization problem
- Rabin-Mostowski index problem: a step beyond deterministic automata
- Sequential algorithms and strongly stable functions
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Testing and generating infinite sequences by a finite automaton
- The Dialectica monad and its cousins
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
Cited in
(7)- Monoidal-closed categories of tree automata
- scientific article; zbMATH DE number 7147442 (Why is no real title available?)
- scientific article; zbMATH DE number 3478775 (Why is no real title available?)
- Fibrations of tree automata
- Monodic Tree Kleene Algebra
- Trees, band monoids and formal languages
- scientific article; zbMATH DE number 7269253 (Why is no real title available?)
This page was built for publication: Monoidal-closed categories of tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220183)
