Search results for "Formal"
showing 10 items of 1654 documents
Elements of Language Theory
1988
In this chapter we shall review the mathematical and computer science background on which the presentation in this book is based. We shall discuss the elements of discrete mathematics and formal language theory, emphasizing those issues that are of importance from the point of view of context-free parsing. We shall devote a considerable part of this chapter to matters such as random access machines and computational complexity. These will be relevant later when we derive efficient algorithms for parsing theoretic problems or prove lower bounds for the complexity of these problems. In this chapter we shall also discuss a general class of formal language descriptors called “rewriting systems”…
Pseudocomplements in sum-ordered partial semirings
2007
We study a particular way of introducing pseudocomplementation in ordered semigroups with zero, and characterise the class of those pseudocomplemented semigroups, termed g-semigroups here, that admit a Glivenko type theorem (the pseudocomplements form a Boolean algebra). Some further results are obtained for g-semirings – those sum-ordered partially additive semirings whose multiplicative part is a g-semigroup. In particular, we introduce the notion of a partial Stone semiring and show that several well-known elementary characteristics of Stone algebras have analogues for such semirings.
The expressive power of the shuffle product
2010
International audience; There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious operation on regular languages.Antonio Restivo proposed as a challenge to characterize the smallest class of languages containing the singletons and closed under Boolean operations, product and shuffle. This problem is still widely open, but we present some partial results on it. We also study some other smaller classes, including the smallest class containing the languages composed of a single word of length 2 which is closed under Boolean operations and shuffle by a letter (resp. shuffle by a l…
On Horn spectra
1991
Abstract A Horn spectrum is a spectrum of a Horn sentence. We show that to solve Asser's problem, and consequently the EXPTIME = ? NEXPTIME question it suffices to consider the class of Horn spectra. We also pose the problem whether or not the generator of every Horn spectrum is a spectrum. We prove that from a negative solution of the generator problem, a negative answer for the EXPTIME = ? NEXPTIME question follows. Some other relations between the generator problem and Asser's problem are given. Finally, the relativized version of the generator problem is formulated and it is shown that it has an affirmative solution for some oracles, and a negative solution for some others.
Rigidity of quasisymmetric mappings on self-affine carpets
2016
We show that the class of quasisymmetric maps between horizontal self-affine carpets is rigid. Such maps can only exist when the dimensions of the carpets coincide, and in this case, the quasisymmetric maps are quasi-Lipschitz. We also show that horizontal self-affine carpets are minimal for the conformal Assouad dimension.
A lower bound for the Bloch radius of 𝐾-quasiregular mappings
2004
We give a quantitative proof to Eremenko’s theorem (2000), which extends Bloch’s classical theorem to the class of n n -dimensional K K -quasiregular mappings.
Generalized John disks
2014
Abstract We establish the basic properties of the class of generalized simply connected John domains.
Models of Computation, Riemann Hypothesis, and Classical Mathematics
1998
Classical mathematics is a source of ideas used by Computer Science since the very first days. Surprisingly, there is still much to be found. Computer scientists, especially, those in Theoretical Computer Science find inspiring ideas both in old notions and results, and in the 20th century mathematics. The latest decades have brought us evidence that computer people will soon study quantum physics and modern biology just to understand what computers are doing.
Indefinitely stable iron(IV) cage complexes formed in water by air oxidation
2017
In nature, iron, the fourth most abundant element of the Earth's crust, occurs in its stable forms either as the native metal or in its compounds in the +2 or +3 (low-valent) oxidation states. High-valent iron (+4, +5, +6) compounds are not formed spontaneously at ambient conditions, and the ones obtained synthetically appear to be unstable in polar organic solvents, especially aqueous solutions, and this is what limits their studies and use. Here we describe unprecedented iron(IV) hexahydrazide clathrochelate complexes that are assembled in alkaline aqueous media from iron(III) salts, oxalodihydrazide and formaldehyde in the course of a metal-templated reaction accompanied by air oxidation…
Supporting bereaved people: a qualitative study on the experience of informal support providers, before and during the pandemic scenario
2023
The COVID-19 outbreak has further highlighted the need to strengthen support networks tosustain grieving people. However, we know very little about the experience of those who,because of their emotional connection with the bereaved person or of their social function,find themselves supporting people in grief. The current study aimed to analyze the experi-ence of grievers’informal support providers (relatives and friends, teachers, religious leaders,funeral providers, pharmacists, volunteers, and social service workers). 162 in-depth inter-views were collected (meanage¼42.3,SD¼14.9; women¼63.6%). Findings highlight twodifferent ways of talking about one’s experience and two different ways of…