Learn More
Chickpea (Cicer arietinum) is the second most widely grown legume crop after soybean, accounting for a substantial proportion of human dietary nitrogen intake and playing a crucial role in food security in developing countries. We report the ∼738-Mb draft whole genome shotgun sequence of CDC Frontier, a kabuli chickpea variety, which contains an estimated(More)
A cover-automaton A of a finite language L ⊆ Σ∗ is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic cover automaton of a finite language L usually has a smaller size than a minimal DFA that accept L. Thus, cover automata can be used to reduce the size of the representations(More)
  • Sheng Yu
  • Journal of Automata, Languages and Combinatorics
  • 2001
State complexity is a descriptive complexity measure for regular languages. We investigate the problems related to the state complexity of regular languages and their operations. In particular, we compare the state complexity results on regular languages with those on nite languages.
We settle an open problem, the inclusion problem for pattern languages [1, 2]. This is the rst known case where inclusion is undecidable for generative devices having a trivially decidable equivalence problem. The study of patterns goes back to the seminal work of Thue [16] and is important also, for instance, in recent work concerning inductive inference(More)
The long latent stage seen in syphilis, followed by chronic central nervous system infection and inflammation, can be explained by the persistence of atypical cystic and granular forms of Treponema pallidum. We investigated whether a similar situation may occur in Lyme neuroborreliosis. Atypical forms of Borrelia burgdorferi spirochetes were induced(More)