224 search results - page 14 / 45 » Three New Algorithms for Regular Language Enumeration |
157
click to vote
IJMC
2006
15 years 6 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
148
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
279
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
165
click to vote
ICSM
2008
IEEE
16 years 26 days ago
2008
IEEE
An automated approach to the identification of C++0x concepts in function templates is described. Concepts are part of a new language feature appearing in the next standard for C+...
168
click to vote
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...