Related papers: Twinning automata and regular expressions for stri…
Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations…
Controllable Automatic Text Simplification (CATS) produces user-tailored outputs, yet controllability is often treated as a decoding problem and evaluated with metrics that are not reflective to the measure of control. We observe that…
In this paper we exploit concepts of information theory to address the fundamental problem of identifying and defining the most suitable tools to extract, in a automatic and agnostic way, information from a generic string of characters. We…
Value-based static analysis techniques express computed program invariants as logical formula over program variables. Researchers and practitioners use these invariants to aid in software engineering and verification tasks. When selecting…
We study the class of pulsating strings on $AdS_5\times T^{1,1}$. Using a generalized ansatz for pulsating string configurations we find new solutions of this class. Further we quasi-classically quantize the theory and obtain the first…
In this Thesis we address the issue of consistent higher-spin interactions taking String Theory as a "theoretical laboratory". We thus arrive at a simple expression encompassing all three-point amplitudes for states belonging to the first…
We propose a new approach to heap analysis through an abstract domain of automata, called automatic shapes. The abstract domain uses a particular kind of automata, called quantified data automata on skinny trees (QSDAs), that allows to…
We study the class of pulsating strings in AdS_5 x T^{1,1}. Using a generalized ansatz for pulsating string configurations we find new solutions of this class. Further we semiclassically quantize the theory and obtain the first correction…
We construct complete sets of (open and closed string) covariant coherent state and mass eigenstate vertex operators in bosonic string theory. This construction can be used to study the evolution of fundamental cosmic strings as predicted…
We discuss various formalisms to describe string-to-string transformations. Many are based on automata and can be seen as operational descriptions, allowing direct implementations when the input scanner is deterministic. Alternatively, one…
The tensionless string theory with perimeter action has pure massless spectrum of higher-spin gauge fields. The multiplicity of these massless states grows linearly. It is therefore much less compared with the standard string theory and is…
We explore different ways of implementing temporal constraints expressed in an extension of Answer Set Programming (ASP) with language constructs from dynamic logic. Foremost, we investigate how automata can be used for enforcing such…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
We introduce the concept of associativity for string functions, where a string function is a unary operation on the set of strings over a given alphabet. We discuss this new property and describe certain classes of associative string…
We develop a static complexity analysis for a higher-order functional language with structural list recursion. The complexity of an expression is a pair consisting of a cost and a potential. The former is defined to be the size of the…
This TASI lecture covers the material in hep-th/9205026. It reviewed the theory of effective strings, with particular emphasis on the manner in which Lorentz invariance is represented. The quantum properties of an example of an effective…
There are at present two known string theories in $(2,2)$ dimensions. One of them is the well known $N=2$ string, and the other one is a more recently constructed $N=1$ spacetime supersymmetric string. They are both based on certain…
To be practically useful, modern static analyzers must precisely model the effect of both, statements in the programming language as well as frameworks used by the program under analysis. While important, manually addressing these…
Slang is a predominant form of informal language making flexible and extended use of words that is notoriously hard for natural language processing systems to interpret. Existing approaches to slang interpretation tend to rely on context…
The control of perceptual voice qualities in a text-to-speech (TTS) system is of interest for applications where unmanipu- lated and manipulated speech probes can serve to illustrate pho- netic concepts that are otherwise difficult to…