Pages that link to "Item:Q5277733"
From MaRDI portal
The following pages link to An effective decision procedure for linear arithmetic over the integers and reals (Q5277733):
Displaying 20 items.
- Solving Łukasiewicz \(\mu\)-terms (Q683713) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- Observations on determinization of Büchi automata (Q860867) (← links)
- A generalization of Cobham's theorem to automata over real numbers (Q1014642) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Regular model checking with regular relations (Q2140498) (← links)
- Complexity of linear relaxations in integer programming (Q2149550) (← links)
- Ambiguity, weakness, and regularity in probabilistic Büchi automata (Q2200844) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- When is scalar multiplication decidable? (Q2311210) (← links)
- An analogue of Cobham's theorem for graph directed iterated function systems (Q2346036) (← links)
- COMPUTING CONVEX HULLS BY AUTOMATA ITERATION (Q3395136) (← links)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (Q3519495) (← links)
- Convex Hull of Arithmetic Automata (Q3522060) (← links)
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) (Q3540195) (← links)
- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (Q3618581) (← links)
- A Generalization of Semenov’s Theorem to Automata over Real Numbers (Q5191120) (← links)
- (Q5216311) (← links)
- Timed Basic Parallel Processes (Q5875376) (← links)
