Sciweavers

4743 search results - page 34 / 949
» The PlusCal Algorithm Language
Sort
View
COCOON
2006
Springer
14 years 1 months ago
Overlap-Free Regular Languages
We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of...
Yo-Sub Han, Derick Wood
DAM
2007
79views more  DAM 2007»
13 years 9 months ago
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular...
Elizabeth Goode, Dennis Pixton
COLING
1996
13 years 11 months ago
Translating into Free Word Order Languages
In this paper, I discuss machine translation of English text into a relatively "free" word order language, specifically Turkish. I present algorithms that use contextual...
Beryl Hoffman
IJFCS
2000
71views more  IJFCS 2000»
13 years 9 months ago
Light Affine Logic as a Programming Language: A First Contribution
This work is about an experimental paradigmatic functional language for programming with P-TIME functions. The language is designed from Intuitionistic Light Affine Logic. It can ...
Luca Roversi
LATIN
2010
Springer
13 years 12 months ago
Complexity of Operations on Cofinite Languages
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
Frédérique Bassino, Laura Giambruno,...