The following pages link to Benedetto Intrigila (Q397403):
Displayed 50 items.
- CGMurphi: automatic synthesis of numerical controllers for nonlinear hybrid systems (Q397407) (← links)
- On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875) (← links)
- On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\) (Q476895) (← links)
- Quasi-polynomials, linear Diophantine equations and semi-linear sets (Q764313) (← links)
- (Q1014451) (redirect page) (← links)
- On structural properties of eta-expansions of identity (Q1014452) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
- Combinatorial principles in elementary number theory (Q1182430) (← links)
- Orders, reduction graphs and spectra (Q1275630) (← links)
- Some new results on easy lambda-terms (Q1314346) (← links)
- On the cop number of a graph (Q1325748) (← links)
- The ant-lion paradigm for strong normalization (Q1336047) (← links)
- Non-existent Statman's double fixed point combinator does not exist, indeed (Q1368379) (← links)
- Synchronized regular expressions (Q1403339) (← links)
- On the generalization of Higman and Kruskal's theorems to regular languages and rational trees (Q1567204) (← links)
- Fixed points in lambda calculus. an eccentric survey of problems and solutions (Q1688969) (← links)
- Some results on extensionality in lambda calculus (Q1765154) (← links)
- A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser (Q1854476) (← links)
- Some results on numerical systems in \(\lambda\)-calculus (Q1903129) (← links)
- On the commutative equivalence of bounded context-free and regular languages: the semi-linear case (Q2257288) (← links)
- On the structure of the counting function of sparse context-free languages. (Q2490812) (← links)
- A remark on infinite matching vs infinite unification (Q2563693) (← links)
- (Q2789520) (← links)
- Synchronized Regular Expressions (Q2841278) (← links)
- (Q2882383) (← links)
- Lambda theories allowing terms with a finite number of fixed points (Q2973253) (← links)
- Automated Generation of Optimal Controllers through Model Checking Techniques (Q3564226) (← links)
- The Omega Rule is $\mathbf{\Pi_{1}^{1}}$ -Complete in the λβ-Calculus (Q3612630) (← links)
- The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete in the $\lambda\beta$-Calculus (Q3636805) (← links)
- BAIRE CATEGORY ON CARDINALS (Q3671962) (← links)
- Negative Results on the Reduction of the Recursion Scheme (Q3803098) (← links)
- (Q3837724) (← links)
- (Q3982064) (← links)
- (Q4008736) (← links)
- The basis decision problem in λ‐calculus (Q4304128) (← links)
- Generating graphical applications from state-transition visual specifications (Q4406139) (← links)
- (Q4417845) (← links)
- (Q4417987) (← links)
- (Q4427905) (← links)
- (Q4522249) (← links)
- On the number of fixed points of a combinator in lambda calculus (Q4526150) (← links)
- (Q4625694) (← links)
- (Q4787235) (← links)
- (Q4934252) (← links)
- (Q4941990) (← links)
- (Q5101343) (← links)
- (Q5111316) (← links)
- Solution of a Problem of Barendregt on Sensible lambda-Theories (Q5310670) (← links)
- Automated Technology for Verification and Analysis (Q5491853) (← links)
- Formal Methods in Computer-Aided Design (Q5492982) (← links)