| 1. |
|
|
| 2. |
|
|
| 3. |
- Bezem, M., et al.
(författare)
-
Skolem's Theorem in Coherent Logic
- 2019
-
Ingår i: Fundamenta Informaticae. - : IOS Press. - 0169-2968 .- 1875-8681. ; 170:1-3, s. 1-14
-
Tidskriftsartikel (refereegranskat)abstract
- We give a constructive proof of Skolem's Theorem for coherent logic and discuss several applications, including a negative answer to a question by Wraith.
|
|
| 4. |
- Cattani, Carlo, et al.
(författare)
-
On the Critical Strip of the Riemann zeta Fractional derivative
- 2017
-
Ingår i: Fundamenta Informaticae. - 0169-2968 .- 1875-8681. ; 151, s. 459-472
-
Tidskriftsartikel (refereegranskat)abstract
- The fractional derivative of the Dirichlet eta function is computed in order to investigate the behavior of the fractional derivative of the Riemann zeta function on the critical strip. Its convergence is studied. In particular, its half-plane of convergence gives the possibility to better understand the fractional derivative of the Riemann zeta function and its critical strip. As an application, two signal processing networks, corresponding to the fractional derivative of the eta function and to its Fourier transform, respectively, are shortly described.
|
|
| 5. |
- Drewes, Frank, et al.
(författare)
-
Tight Bounds for Cut-Operations on Deterministic Finite Automata
- 2017
-
Ingår i: Fundamenta Informaticae. - : IOS Press. - 0169-2968 .- 1875-8681. - 9783319231112 - 9783319231105 ; 155, s. 89-110
-
Tidskriftsartikel (refereegranskat)abstract
- We investigate the state complexity of the cut and iterated cut operation for determin- istic finite automata (DFAs), answering an open question stated in [M. BERGLUND, et al.: Cuts in regular expressions. In Proc. DLT, LNCS 7907, 2011]. These operations can be seen as an al- ternative to ordinary concatenation and Kleene star modelling leftmost maximal string matching. We show that the cut operation has a matching upper and lower bound of n states, if m = 1, and (n−1)·m+n states, otherwise, on DFAs accepting the cut of two individual languages that are ac- cepted by n- and m-state DFAs, respectively. In the unary case we obtain max(2n − 1, m + n − 2) states as a tight bound—notice that for m ≤ n the bound for unary DFAs only depends on the former automaton and not on the latter. For accepting the iterated cut of a language accepted by an n-state DFA we find a matching bound of 1+(n+1)·F(1,n+2,−n+2;n+1 | −1) states on DFAs, if n ≥ 4 and where F refers to the generalized hypergeometric function. This bound is in the order of magnitude Θ((n − 1)!). Finally, the bound drops to 2n − 1 for unary DFAs accepting the iterated cut of an n-state DFA, if n ≥ 3, and thus is similar to the bound for the cut operation on unary DFAs.
|
|
| 6. |
|
|
| 7. |
- Loukanova, Roussanka
(författare)
-
An Approach to Functional Formal Models of Constraint-Based Lexicalized Grammar
- 2017
-
Ingår i: Fundamenta Informaticae. - 0169-2968 .- 1875-8681. ; 152:4, s. 341-372
-
Tidskriftsartikel (refereegranskat)abstract
- This paper is a review of the formal definitions of a description language of functional models of Constraint-Based Lexicalized Grammar (CBLG), with a notion of well-formedness, models of linguistic objects, and the corresponding denotation function. The language uses feature-value descriptions. A formalization of CBLG is presented via definitions of several classes of objects by this formal language using mutual recursion. The core engine of the CBLG formal grammar is a hierarchical type system associated with constraints for representation of linguistic information. The constraints are classified as linguistic principles, grammar rules, lexical entries, lexical rules, and semantic representations. The formal system of CBLG targets a computational approach to human language grammar.
|
|
| 8. |
- Loukanova, Roussanka
(författare)
-
Gamma-Reduction in Type Theory of Acyclic Recursion
- 2019
-
Ingår i: Fundamenta Informaticae. - 0169-2968 .- 1875-8681. ; 170:4, s. 367-411
-
Tidskriftsartikel (refereegranskat)abstract
- In this article, we introduce Moschovakis higher-order type theory of acyclic recursion L-ar(lambda) . We present the potentials of L-ar(lambda) for incorporating different reduction systems in L-ar(lambda), with corresponding reduction calculi. At first, we introduce the original reduction calculus of L-ar(lambda), which reduces L-ar(lambda)-terms to their canonical forms. This reduction calculus determines the relation of referential, i.e., algorithmic, synonymy between L-ar(lambda)-terms with respect to a chosen semantic structure. Our contribution is the definition of a (gamma) rule and extending the reduction calculus of L-ar(lambda) and its referential synonymy to gamma-reduction and gamma-synonymy, respectively. The gamma-reduction is very useful for simplification of terms in canonical forms, by reducing subterms having superfluous gamma-abstraction and corresponding functional applications. Typically, such extra gamma abstractions can be introduced by the gamma-rule of the reduction calculus of L-ar(lambda).
|
|
