Search results for "prefix"

Codes and automata

2006

Suffix Automata and Standard Sturmian Words

2007

Blumer et al. showed (cf. [3,2]) that the suffix automaton of a word w must have at least |w|+1 states and at most 2|w|-1 states. In this paper we characterize the language L of all binary words w whose minimal suffix automaton S(w) has exactly |w| + 1 states; they are precisely all prefixes of standard Sturmian words. In particular, we give an explicit construction of suffix automaton of words that are palindromic prefixes of standard words. Moreover, we establish a necessary and sufficient condition on S(w) which ensures that if w ∈ L and a ∈ {0, 1} then wa ∈ L. By using such a condition, we show how to construct the automaton S(wa) from S(w). More generally, we provide a simple construct…

Some Decision Results on Nonrepetitive Words

1985

The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.

Quantifying English and Polish Lolitas: A Corpus-Driven Stylistic Comparison

2013

The study presented in this article, which is a fragment of a larger study of translational and non- translational texts (Grabowski 2012), falls within the scope of descriptive translation studies (DTS) and corpus linguistics, with particular emphasis on the study of translation universals, on the example of English-original (written in 1955) and two independent Polish translations of the novel Lolita by V. Nabokov (by Stiller in 1991 and Klobukowski in 1997). According to Baker (1995: 243), universal features of translation or translation universals, constitute specific textual characteristics (e.g. lexical, grammatical or stylistic) typical of translated texts, irrespective of languages i…

Degrees of Acting Parliamentarily

2018

The chapter deals with the distinct chances to extend parliamentary thinking of politics beyond parliaments in ordinary sense and discuss its limits. The point of comparing the parliamentary paradigm with other types of politics, such as intra-party struggles or multilateral diplomacy, lies in constructing a spectrum from the parliament to other assemblies. To analyse parliamentary degree of politics for example the prefixes as proto-, semi-, quasi- or pseudo-parliamentary assemblies are analysed. A special case lies in the relationships between academic and parliamentary debates based on the recognition of the dissensus, but having for example different relationships to written and oral de…

Classification of prefix aiz- ‘away’ meanings: from Jānis Endzelīns approach to nowadays

2019

The polysemic nature of prefixes in Latvian causes problems in prefix classification. Several authors in different time periods have proposed diverse prefix classification systems. In this research, three different classification systems of prefix aiz- ‘away’ are compared – the classification system created by Endzelīns (1971) in 1907, the classification system created by Soida in 1970 (printed in 2009), and the classification system proposed by Vulāne (2015). To ascertain which meanings are used nowadays the examples are drawn from the corpus. There are 11 prefixes in the Latvian language used in word-formation. In this research, prefix aiz- is chosen as it has a rich meaning system althou…

Left-to-right tree pattern matching

1991

We propose a new technique to construct left-to-right matching automata for trees. Our method is based on the novel concept of prefix unifcation which is used to compute a certain closure of the pattern set. From the closure a kind of deterministic matching automaton can be derived immediately. We also point out how to perform the construction incrementally which makes our approach suitable for applications in which pattern sets change dynamically, such as in the Knuth-Bendix completion algorithm.

Preface to the special issue entitled “New frontiers in photo(thermo)catalysis” in honour of Prof. Leonardo Palmisano

2021

This Special issue of Catalysis Today entitled “New frontiers in photo(thermo)catalysis” is dedicated to the retirement and to the career of the colleague and friend Prof. Leonardo Palmisano who devoted his life to Science and students

Dictionary-symbolwise flexible parsing

2012

AbstractLinear-time optimal parsing algorithms are rare in the dictionary-based branch of the data compression theory. A recent result is the Flexible Parsing algorithm of Matias and Sahinalp (1999) that works when the dictionary is prefix closed and the encoding of dictionary pointers has a constant cost. We present the Dictionary-Symbolwise Flexible Parsing algorithm that is optimal for prefix-closed dictionaries and any symbolwise compressor under some natural hypothesis. In the case of LZ78-like algorithms with variable costs and any, linear as usual, symbolwise compressor we show how to implement our parsing algorithm in linear time. In the case of LZ77-like dictionaries and any symbol…

An Improved Receiver Architecture for Cyclic-Prefixed OFDM

2009

A novel Orthogonal Frequency Division Multiplexing receiver architecture to be employed with standard (e.g. Wireless LAN) transmitters is proposed. It features enhanced error-rate performance with flexible computational complexity and robustness to imperfect channel estimation. It is based on exploitation of the redundancy available in the cyclic prefix after cancellation of interference from the previous block. In order to show the effectiveness of our proposal, a number of comparisons to the standard per-subcarrier receiver and a previously existing method are reported.