69 search results - page 6 / 14 » dlt 2007 |
DLT
2006
13 years 11 months ago
2006
We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and -synchronous for two different numbers and , then it is recognizab...
DLT
2001
13 years 11 months ago
2001
Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization all...
DLT
2003
13 years 11 months ago
2003
The notion of sequential and parallel decomposition of a language over a set of languages was introduced by Schnoebelen. A language is decomposable if it belongs to a finite set ...
DLT
2004
13 years 11 months ago
2004
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
DLT
2006
13 years 11 months ago
2006
We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing the language yields a...