Pages that link to "Item:Q5878899"
From MaRDI portal
The following pages link to Diophantine equations, Presburger arithmetic and finite automata (Q5878899):
Displaying 18 items.
- On the solvability of a class of Diophantine equations and applications (Q818150) (← links)
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable (Q1044697) (← links)
- Automatic verification of recursive procedures with one integer parameter. (Q1401233) (← links)
- Counting the solutions of Presburger equations without enumerating them. (Q1426156) (← links)
- On iterating linear transformations over recognizable sets of integers (Q1884908) (← links)
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534) (← links)
- A note on branching of \(V( \rho )\) (Q2068135) (← links)
- Structural Presburger digit vector automata (Q2378536) (← links)
- Components of \(V(\rho)\otimes V(\rho)\) (Q2411018) (← links)
- A class of polynomially solvable range constraints for interval analysis without widenings (Q2575737) (← links)
- Tree languages and branched groups (Q2697521) (← links)
- More Than 1700 Years of Word Equations (Q2947143) (← links)
- ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS (Q3526543) (← links)
- (Q5227519) (← links)
- Compiler Construction (Q5308733) (← links)
- Behavior decompositions and two-sided diophantine equations (Q5947648) (← links)
- Proving safety properties of infinite state systems by compilation into Presburger arithmetic (Q6044119) (← links)
- Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility (Q6109598) (← links)
