Related content

Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

By Fisher Nathan   Goossens Joël   Baruah Sanjoy  

Real-Time Systems, Vol. 45, Iss. 1-2, 2010-06 ,pp. : 26-71

Springer Publishing Company

Access to resources Recommend Favorite

Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks

By Marchand Audrey   Silly-Chetto Maryline  

Real-Time Systems, Vol. 32, Iss. 1-2, 2006-02 ,pp. : 21-47

Springer Publishing Company

Access to resources Recommend Favorite

Regular component decomposition of regular languages

By Liu Y.J.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 743-749

Elsevier

Access to resources Recommend Favorite

Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R 1 &unknown;R&unknown;R 2 for given regular languages R 1 ,R 2

By Hashiguchi K.  

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 853-859

Elsevier

Access to resources Recommend Favorite

On the acceptance power of regular languages

By Borchert B.  

Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. : 207-225

Elsevier

Access to resources Recommend Favorite