513 search results - page 10 / 103 » Finitely Based, Finite Sets of Words |
ACL
2010
13 years 6 months ago
2010
In this paper, we propose a novel method for automatic segmentation of a Sanskrit string into different words. The input for our segmentizer is a Sanskrit string either encoded as...
ATVA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
CALCO
2005
Springer
14 years 2 months ago
2005
Springer
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
CISIS
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— In this paper, we integrate the traditional finitestate automata (words, or string based) into the membrane computing paradigm, as previous work prevalently concentrat...
SIAMSC
2008
13 years 8 months ago
2008
We present a new method to simulate optical waves in large geometries. This method is based on newly developed finite elements, so-called Trigonometric Finite Wave Elements (TFWEs)...