11,409 research outputs found
Parikh and Wittgenstein
No full textA survey of Parikh’s philosophical appropriations of Wittgensteinian themes, placed into historical context against the backdrop of Turing’s famous paper, “On computable numbers, with an application to the Entscheidungsproblem” (Turing in Proc Lond Math Soc 2(42): 230–265, 1936/1937) and its connections with Wittgenstein and the foundations of mathematics. Characterizing Parikh’s contributions to the interaction between logic and philosophy at its foundations, we argue that his work gives the lie to recent presentations of Wittgenstein’s so-called metaphilosophy (e.g., Horwich in Wittgenstein’s metaphilosophy. Oxford University Press, Oxford, 2012) as a kind of “dead end” quietism. From early work on the idea of a feasibility in arithmetic (Parikh in J Symb Log 36(3):494–508, 1971) and vagueness (Parikh in Logic, language and method. Reidel, Boston, pp 241–261, 1983) to his more recent program in social software (Parikh in Advances in modal logic, vol 2. CSLI Publications, Stanford, pp 381–400, 2001a), Parikh’s work encompasses and touches upon many foundational issues in epistemology, philosophy of logic, philosophy of language, and value theory. But it expresses a unified philosophical point of view. In his most recent work, questions about public and private languages, opportunity spaces, strategic voting, non-monotonic inference and knowledge in literature provide a remarkable series of suggestions about how to present issues of fundamental importance in theoretical computer science as serious philosophical issues
Introduction
No full textThis is a collection of essays in honour of Professor Jyoti K. Parikh. Chapters in this book are written by prominent academics and practitioners who have had a professional connection with Professor Parikh during her long and distinguished career. The book engages with different dimensions of sustainable development and growth and presents a scholarly debate that is relevant to policy and research. The definition of sustainability has evolved considerably. An early definition of sustainable development was presented in the Brundtland Report in 1987, which defined sustainable development as the “development that meets the needs of the present generation without compromising the ability of future generations to meet their own needs”
A toolkit for Parikh matrices
No full textThe Parikh matrix mapping is a concept that provides information on the number of occurrences of certain (scattered) subwords in a word. Although Parikh matrices have been thoroughly studied, many of their basic properties remain open. In the present paper, we describe a toolkit that has been developed to support research in this field. Its functionality includes elementary and advanced operations related to Parikh matrices and the recently introduced variants of P -Parikh matrices and L -Parikh matrices.</p
A toolkit for Parikh matrices
No full textThe Parikh matrix mapping is a concept that provides information on the number of occurrences of certain (scattered) subwords in a word. Although Parikh matrices have been thoroughly studied, many of their basic properties remain open. In the present paper, we describe a toolkit that has been developed to support research in this field. Its functionality includes elementary and advanced operations related to Parikh matrices and the recently introduced variants of P -Parikh matrices and L -Parikh matrices.</p
Uniformly Parikh-friendly words
No full textParikh (vektör) dönüşümü biçimsel dil kuramının önemli kavramlarından biridir. Parikh vektörlerinde temel fikir kelimelerin özelliklerini vektörlerin nümerik özellikleri olarak ifade edebilmektir. Ancak kelimeleri vektörlere taşırken çok sayıda bilgi kaybolur. Bundan dolayı Parikh dönüşümünün genelleştirilmesi olan Parikh matris dönüşümü tanıtılmıştır. Bir kelimenin Parikh matrisi, o kelimenin bazı alt kelime sayıları ile ilgili bilgi veren bir üst üçgen matristir. Böyle bir matrisin ikinci köşegeninde Parikh vektörü oluşur. Genelleştirilmiş Parikh matris dönüşümü Parikh matris dönüşümünün genelleştirilmesidir ve Σk={a1The Parikh mapping (vector) is an important notion in the theory of formal languages. The basic idea behind Parikh vectors is that properties of words are expressed as numerical properties of vectors. However, much of the information is lost in the transition from words to vectors. Therefore, the Parikh matrix mapping which is a generalization of the Parikh mapping has been introduced. The Parikh matrix of a word is an upper triangular matrix which contains information on the number of occurences of certain subwords of that word. The Parikh vector will appear in such a matrix as the second diagonal. The generalized Parikh matrix mapping is extension of Parikh matrix mapping induced by a word instead of being defined with respect to an ordered alphabet Σk={a
Operational state complexity under Parikh equivalence
No full textWe investigate, under Parikh equivalence, the state complexity of some language operations which preserve regularity. For union, concatenation, Kleene star, complement, intersection, shuffle, and reversal, we obtain a polynomial state complexity over any fixed alphabet, in contrast to the intrinsic exponential state complexity of some of these operations in the classical version. For projection we prove a superpolynomial state complexity, which is lower than the exponential one of the corresponding classical operation. We also prove that for each two deterministic automata A and B it is possible to obtain a deterministic automaton with a polynomial number of states whose accepted language has as Parikh image the intersection of the Parikh images of the languages accepted by A and B. Finally, we prove that for each finite set there exists a small context-free grammar defining a language with the same Parikh image
Parikh - Do in-silico models provide improved risk prediction of drug-induced Torsades de Pointes?
No full textA talk given by Jaimit Parikh at the CiPA in-silico modelling satellite meeting to Cardiac Physiome Workshop, Toronto, November 2017
Extending Parikh q-matrices
No full textThe notion of extending Parikh q-matrix with respect to a word instead of an ordered alphabet is introduced. Some basic properties of this extending Parikh q-matrices have been investigated. Also it has been shown that the extending Parikh q-matrix mapping can be obtained as a composition of a Parikh q-matrix mapping and a word substitution morphism
Ovarian steroid cell tumor in pregnancy-a rare occurrence: Report of a case and review of the literature
No full textBackground: Steroid-cell tumors of the ovary are very rare, especially during pregnancy, and they must be distinguished from luteoma of pregnancy.
Case: An 18-year-old female, gravida 3, para 1-0-1-1, at 38 weeks' of gestation, had an adnexal mass that was discovered incidentally during a Caesarean section. The tumor was excised and her male infant was normal.
Results: Histologic workup revealed the tumor to be a steroid-cell tumor, which is exceedingly rare in pregnancy.
Conclusions: Ovarian steroid-cell tumors, which are malignant one-third of the time, are difficult to distinguish from luteoma of pregnancy.Peer reviewe
Parikh One-Counter Automata
No full textCounting abilities in finite automata are traditionally provided by two orthogonal extensions: adding a single counter that can be tested for zeroness at any point, or adding ℤ-valued counters that are tested for equality only at the end of runs. In this paper, finite automata extended with both types of counters are introduced. They are called Parikh One-Counter Automata (POCA): the "Parikh" part referring to the evaluation of counters at the end of runs, and the "One-Counter" part to the single counter that can be tested during runs.
Their expressiveness, in the deterministic and nondeterministic variants, is investigated; it is shown in particular that there are deterministic POCA languages that cannot be expressed without nondeterminism in the original models. The natural decision problems are also studied; strikingly, most of them are no harder than in the original models. A parametric version of nonemptiness is also considered
- …
