Cited By
View all- Cristiá MRossi G(2024)A Practical Decision Procedure for Quantifier-Free, Decidable Languages Extended with Restricted QuantifiersJournal of Automated Reasoning10.1007/s10817-024-09713-668:4Online publication date: 24-Oct-2024
Let K be a field, k and n positive integers and let A_1, \ldots ,A_k be n \times n- matrices with coefficients in K . For any function \[ g\colon \Gamma:= \{ t:=(t_1, ldots ,t_k) in N^k \vert t_1 t_2 \ldots t_k = 0 \} \ \to \ K^n \] there exists a ...
Given a set I of words, the set L$_{\rm \vdash}^{\epsilon}~_{\rm I}$ of all words obtained by the shuffle of (copies of) words of I is naturally provided with a partial order: for u, v in L$_{\rm \vdash}^{\epsilon}~_{\rm I}$, u$\vdash^{\rm *}_{I}$v if ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in