Monoidal-closed categories of tree automata
DOI10.1017/S0960129519000173zbMath1435.68183OpenAlexW2785841537MaRDI QIDQ5220183
Publication date: 11 March 2020
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129519000173
monadic second-order logiclinear logiccategorical logicCurry-Howard correspondenceautomata on infinite trees
Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) 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)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Choice functions and well-orderings over the infinite binary tree
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Lectures on the Curry-Howard isomorphism
- Alternating automata on infinite trees
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Categorical logic and type theory
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Determinization and memoryless winning strategies
- Glueing and orthogonality for models of linear logic
- Monadic second-order logic on tree-like structures
- Ambiguous classes in \(\mu\)-calculi hierarchies
- A theory of sequentiality
- On full abstraction for PCF: I, II and III
- Automata, logics, and infinite games. A guide to current research
- Comparing hierarchies of types in models of linear logic
- An algebraic proof of Rabin's tree theorem
- A Dialectica-like interpretation of a linear MSO on infinite words
- Asynchronous games. II: The true concurrency of innocence
- Sequential algorithms and strongly stable functions
- On dialogue games and coherent strategies
- First steps in synthetic guarded domain theory: step-indexing in the topos of trees
- Rabin's uniformization problem
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- MSO on the Infinite Binary Tree: Choice and Order
- An Explicit Formula for the Free Exponential Modality of Linear Logic
- Nondeterminism in Game Semantics via Sheaves
- A Fibrational Account of Local States
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
- LMSO
- Monoidal-closed categories of tree automata
- Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata
- Fibrations of Tree Automata
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Testing and generating infinite sequences by a finite automaton
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Proof theory in the abstract
This page was built for publication: Monoidal-closed categories of tree automata
