221 search results - page 7 / 45 » Periodic and Sturmian languages |
DATE
2003
IEEE
14 years 28 days ago
2003
IEEE
We propose a new approach to accelerate transaction level verification by raising the productivity of the verification suites including test patterns, protocol checker, and simula...
FCT
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
FLAIRS
2008
13 years 10 months ago
2008
This study explores how Latent Semantic Analysis (LSA) can be used as a method to examine the lexical development of second language (L2) speakers. This year long longitudinal stu...
PARLE
1987
13 years 11 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
TCS
2008
13 years 7 months ago
2008
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...