219 search results - page 39 / 44 » Combinatorial Complexity of Regular Languages |
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
CLIMA
2004
14 years 11 months ago
2004
Communication plays a fundamental role in multi-agents systems. One of the main issues in the design of agent interaction protocols is the verification that a given protocol implem...
JALC
2007
14 years 10 months ago
2007
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
LADS
2007
Springer
15 years 4 months ago
2007
Springer
One of the main reasons about the success of the Web is that many “regular users” are able to create Web pages that, using hyperlinks, incrementally extend both the size and th...