Facet browsing currently unavailable
Page 1 of 5203 results
Sort by: relevance publication year
Finding a homomorphism between two words in NP-complete JOURNAL ARTICLE published August 1979 in Information Processing Letters |
The (generalized) post correspondence problem with lists consisting of two words is decidable JOURNAL ARTICLE published November 1982 in Theoretical Computer Science |
FPOL systems generating counting languages JOURNAL ARTICLE published 1981 in RAIRO. Informatique théorique |
An observation on scattered grammars JOURNAL ARTICLE published August 1979 in Information Processing Letters |
Some consequences of a result of Ehrenfeucht and Rozenberg JOURNAL ARTICLE published 1980 in RAIRO. Informatique théorique |
On the separating power of EOL systems JOURNAL ARTICLE published 1983 in RAIRO. Informatique théorique |
On ambiguity in DOS systems JOURNAL ARTICLE published 1984 in RAIRO. Informatique théorique |
On subword complexities of homomorphic images of languages JOURNAL ARTICLE published 1982 in RAIRO. Informatique théorique |
Strong iterative pairs and the regularity of context-free languages JOURNAL ARTICLE published 1985 in RAIRO. Informatique théorique |
Permutations, parenthesis words, and Schröder numbers JOURNAL ARTICLE published August 1998 in Discrete Mathematics |
On some context free languages that are not deterministic ETOL languages JOURNAL ARTICLE published 1977 in RAIRO. Informatique théorique |
On the structure of polynomially bounded DOL systems JOURNAL ARTICLE published 1 January 1979 in Fundamenta Informaticae |
Periodicity and unbordered segments of words JOURNAL ARTICLE published 1979 in Discrete Mathematics |
On ET0L Systems with rank JOURNAL ARTICLE published December 1979 in Journal of Computer and System Sciences |
A Relationship between ETOL and EDTOL Languages JOURNAL ARTICLE published 1 November 1974 in DAIMI Report Series |
CIRCULARITY AND OTHER INVARIANTS OF GENE ASSEMBLY IN CILIATES BOOK CHAPTER published November 2001 in Words, Semigroups, and Transductions |
Figure 1: Comparison of NP and BDNF between the two groups (n = 88). COMPONENT published |
Every two equivalent D0L systems have a regular true envelope JOURNAL ARTICLE published January 1980 in Theoretical Computer Science |
A relationship between ET0L and EDT0L languages JOURNAL ARTICLE published April 1976 in Theoretical Computer Science |
On the emptiness of the intersection of two DOS languages problem JOURNAL ARTICLE published July 1980 in Information Processing Letters |