Monoidal-closed categories of tree automata
DOI10.1017/S0960129519000173zbMATH Open1435.68183OpenAlexW2785841537MaRDI QIDQ5220183FDOQ5220183
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Categorical logic and type theory
- On full abstraction for PCF: I, II and III
- Rabin's uniformization problem
- MSO on the Infinite Binary Tree: Choice and Order
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Lectures on the Curry-Howard isomorphism
- Monadic second-order logic on tree-like structures
- Automata, logics, and infinite games. A guide to current research
- Sequential algorithms and strongly stable functions
- Alternating automata on infinite trees
- Testing and generating infinite sequences by a finite automaton
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Asynchronous games. II: The true concurrency of innocence
- An Explicit Formula for the Free Exponential Modality of Linear Logic
- Glueing and orthogonality for models of linear logic
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- Choice functions and well-orderings over the infinite binary tree
- Ambiguous classes in \(\mu\)-calculi hierarchies
- Proof theory in the abstract
- Comparing hierarchies of types in models of linear logic
- A theory of sequentiality
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Nondeterminism in Game Semantics via Sheaves
- Determinization and memoryless winning strategies
- First steps in synthetic guarded domain theory: step-indexing in the topos of trees
- Monoidal-closed categories of tree automata
- An algebraic proof of Rabin's tree theorem
- Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata
- On dialogue games and coherent strategies
- A Fibrational Account of Local States
- A Dialectica-like interpretation of a linear MSO on infinite words
- Fibrations of Tree Automata
- LMSO
Cited In (6)
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)
