Linear Parsing Expression Grammars

PEGs were formalized by Ford in 2004, and have several pragmatic operators (such as ordered choice and unlimited lookahead) for better expressing modern programming language syntax. Since these operators are not explicitly defined in the classic formal language theory, it is significant and still challenging to argue PEGs' expressiveness in the context of formal language theory.Since PEGs are relatively new, there are several unsolved problems.One of the problems is revealing a subclass of PEGs that is equivalent to DFAs. This allows application of some techniques from the theory of regular grammar to PEGs. In this paper, we define Linear PEGs (LPEGs), a subclass of PEGs that is equivalent to DFAs. Surprisingly, LPEGs are formalized by only excluding some patterns of recursive nonterminal in PEGs, and include the full set of ordered choice, unlimited lookahead, and greedy repetition, which are characteristic of PEGs. Although the conversion judgement of parsing expressions into DFAs is undecidable in general, the formalism of LPEGs allows for a syntactical judgement of parsing expressions.Comment: Parsing expression grammars, Boolean finite automata, Packrat parsin

Decision Problems For Convex Languages

In this paper we examine decision problems associated with various classes of convex languages, studied by Ang and Brzozowski (under the name "continuous languages"). We show that we can decide whether a given language L is prefix-, suffix-, factor-, or subword-convex in polynomial time if L is represented by a DFA, but that the problem is PSPACE-hard if L is represented by an NFA. In the case that a regular language is not convex, we prove tight upper bounds on the length of the shortest words demonstrating this fact, in terms of the number of states of an accepting DFA. Similar results are proved for some subclasses of convex languages: the prefix-, suffix-, factor-, and subword-closed languages, and the prefix-, suffix-, factor-, and subword-free languages.Comment: preliminary version. This version corrected one typo in Section 2.1.1, line

A Computational Interpretation of Context-Free Expressions

We phrase parsing with context-free expressions as a type inhabitation problem where values are parse trees and types are context-free expressions. We first show how containment among context-free and regular expressions can be reduced to a reachability problem by using a canonical representation of states. The proofs-as-programs principle yields a computational interpretation of the reachability problem in terms of a coercion that transforms the parse tree for a context-free expression into a parse tree for a regular expression. It also yields a partial coercion from regular parse trees to context-free ones. The partial coercion from the trivial language of all words to a context-free expression corresponds to a predictive parser for the expression

Computing with and without arbitrary large numbers

In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, is enough to reduce the computational complexity of some problems. However, this has only been shown so far for specific problems. We provide a characterization of the power of such extra inputs for general problems. To do so, we first correct a classical result by Simon and Szegedy (1992) as well as one by Simon (1981). In the former we show mistakes in the proof and correct these by an entirely new construction, with no great change to the results. In the latter, the original proof direction stands with only minor modifications, but the new results are far stronger than those of Simon (1981). In both cases, the new constructions provide the theoretical tools required to characterize the power of arbitrary large numbers.Comment: 12 pages (main text) + 30 pages (appendices), 1 figure. Extended abstract. The full paper was presented at TAMC 2013. (Reference given is for the paper version, as it appears in the proceedings.

Circulating microparticles as biomarkers of stroke: A focus on the value of endothelial- and platelet-derived microparticles.

Stroke is one of the leading causes of mortality and disability worldwide. Numerous pathophysiological mechanisms involving blood vessels, coagulation and inflammation contribute to the vascular occlusion. Perturbations in these pathways can be detected by numerous methods including changes in endoplasmic membrane remodeling and rearrangement leading to the shedding of microparticles (MPs) from various cellular origins in the blood. MPs are small membrane-derived vesicles that are shed from nearly all cells in the body in resting state or upon stimulation. MPs act as biological messengers to transfer information to adjacent and distant cells thus regulating various biological processes. MPs may be important biomarkers and tools for the identification of the risk and diagnosis of cerebrovascular diseases. Endothelial activation and dysfunction and altered thrombotic responses are two of the main features predisposing to stroke. Endothelial MPs (EMPs) have been recognized as both biomarkers and effectors of endothelial cell activation and injury while platelet-derived MPs (PMPs) carry a strong procoagulant potential and are activated in thrombotic states. Therefore, we reviewed here the role of EMPs and PMPs as biomarkers of stroke. Most studies reported high circulating levels of EMPs and PMPs in addition to other cell origins in stroke patients and have been linked to stroke severity, the size of infarction, and prognosis. The identification and quantification of EMPs and PMPs may thus be useful for the diagnosis and management of stroke.NPRP award (NPRP8-1750-3-360) from Qatar National Research Fund (a member of Qatar Foundation) and a Qatar University high collaborative grant (QUCG-CPH-2018\2019-2

Human behavior in Prisoner's Dilemma experiments suppresses network reciprocity

During the last few years, much research has been devoted to strategic interactions on complex networks. In this context, the Prisoner's Dilemma has become a paradigmatic model, and it has been established that imitative evolutionary dynamics lead to very different outcomes depending on the details of the network. We here report that when one takes into account the real behavior of people observed in the experiments, both at the mean-field level and on utterly different networks the observed level of cooperation is the same. We thus show that when human subjects interact in an heterogeneous mix including cooperators, defectors and moody conditional cooperators, the structure of the population does not promote or inhibit cooperation with respect to a well mixed population.Comment: 5 Pages including 4 figures. Submitted for publicatio

Construct, Merge, Solve and Adapt: Application to the repetition-free longest common subsequence problem

In this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the repetition-free longest common subsequence problem. The applied algorithm, which is labelled Construct, Merge, Solve & Adapt, generates sub-instances based on merging the solution components found in randomly constructed solutions. These sub-instances are subsequently solved by means of an exact solver. Moreover, the considered sub-instances are dynamically changing due to adding new solution components at each iteration, and removing existing solution components on the basis of indicators about their usefulness. The results of applying this algorithm to the repetition-free longest common subsequence problem show that the algorithm generally outperforms competing approaches from the literature. Moreover, they show that the algorithm is competitive with CPLEX for small and medium size problem instances, whereas it outperforms CPLEX for larger problem instances.Peer ReviewedPostprint (author's final draft

An output-sensitive algorithm for the minimization of 2-dimensional String Covers

String covers are a powerful tool for analyzing the quasi-periodicity of 1-dimensional data and find applications in automata theory, computational biology, coding and the analysis of transactional data. A \emph{cover} of a string $T$ is a string $C$ for which every letter of $T$ lies within some occurrence of $C$. String covers have been generalized in many ways, leading to \emph{k-covers}, \emph{$\lambda$-covers}, \emph{approximate covers} and were studied in different contexts such as \emph{indeterminate strings}. In this paper we generalize string covers to the context of 2-dimensional data, such as images. We show how they can be used for the extraction of textures from images and identification of primitive cells in lattice data. This has interesting applications in image compression, procedural terrain generation and crystallography

Interaction of quasilocal harmonic modes and boson peak in glasses

The direct proportionality relation between the boson peak maximum in glasses, $\omega_b$, and the Ioffe-Regel crossover frequency for phonons, $\omega_d$, is established. For several investigated materials $\omega_b = (1.5\pm 0.1)\omega_d$. At the frequency $\omega_d$ the mean free path of the phonons $l$ becomes equal to their wavelength because of strong resonant scattering on quasilocal harmonic oscillators. Above this frequency phonons cease to exist. We prove that the established correlation between $\omega_b$ and $\omega_d$ holds in the general case and is a direct consequence of bilinear coupling of quasilocal oscillators with the strain field.Comment: RevTex, 4 pages, 1 figur