The following pages link to (Q4344149):
Displaying 34 items.
- Automatic Proof Generation in Kleene Algebra (Q3498428) (← links)
- Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA (Q3584969) (← links)
- Antimirov and Mosses’s Rewrite System Revisited (Q3602800) (← links)
- A Kleene Theorem for Polynomial Coalgebras (Q3617725) (← links)
- Towards a unified view of finite automata and semi-Markov flowgraph models (Q3654550) (← links)
- (Q3768406) (← links)
- (Q3785947) (← links)
- (Q3803205) (← links)
- (Q3970886) (← links)
- (Q4029346) (← links)
- (Q4260339) (← links)
- Computability by finite automata and pisot bases (Q4298373) (← links)
- (Q5009453) (← links)
- Halos and undecidability of tensor stable positive maps (Q5052027) (← links)
- Undecidability of the Spectral Gap (Q5084676) (← links)
- Sequential Relational Decomposition (Q5094122) (← links)
- (Q5111639) (← links)
- Agent-Based Modeling, Mathematical Formalism for (Q5150305) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)
- Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences (Q5237090) (← links)
- (Q5376662) (← links)
- (Q5387725) (← links)
- Languages, Decidability, and Complexity (Q5496920) (← links)
- A Finite Axiomatisation of Finite-State Automata Using String Diagrams (Q5883739) (← links)
- Deconfined Global Types for Asynchronous Sessions (Q5883749) (← links)
- A Myhill-Nerode theorem for register automata and symbolic trace languages (Q5918650) (← links)
- On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus (Q6040672) (← links)
- Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)
- On Minimal Pumping Constants for Regular Languages (Q6204130) (← links)
- Trace Abstraction-Based Verification for Uninterpreted Programs (Q6488472) (← links)
- A vertex operator reformulation of the Kanade-Russell conjecture modulo 9 (Q6612395) (← links)
- Ramsey quantifiers over automatic structures: complexity and applications to verification (Q6649458) (← links)
- A type theory for strictly unital \(\infty \)-categories (Q6649483) (← links)
- On pumping preserving homomorphisms and the complexity of the pumping problem (extended abstract) (Q6666794) (← links)
