The following pages link to (Q4518891):
Displaying 16 items.
- LASH (Q33079) (← links)
- Construction of Aho Corasick automaton in linear time for integer alphabets (Q844159) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable (Q1044697) (← links)
- A construction on finite automata that has remained hidden (Q1275469) (← links)
- Counting the solutions of Presburger equations without enumerating them. (Q1426156) (← links)
- A type checking algorithm for concurrent object protocols (Q1785846) (← links)
- On iterating linear transformations over recognizable sets of integers (Q1884908) (← links)
- On the expressiveness of Büchi arithmetic (Q2233416) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- Structural Presburger digit vector automata (Q2378536) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order (Q2988842) (← links)
- Formalizing the Logic-Automaton Connection (Q3183526) (← links)
- Symbolic String Verification: Combining String Analysis and Size Analysis (Q3617765) (← links)
- Geometric decision procedures and the VC dimension of linear arithmetic theories (Q6649496) (← links)
