Search Sciweavers | Sciweavers

A real is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals. A real is random if its binary expansion is a random sequence. Ou...

Cristian Calude

claim paper

Read More »

30

click to vote

TCS
1998

100views Theoretical Computer Science» more TCS 1998»

Parsing Schemata and Correctness of Parsing Algorithms

13 years 9 months ago

Download wwwhome.cs.utwente.nl

Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a pars...

Klaas Sikkel

claim paper

Read More »

31

click to vote

TCS
1998

96views Theoretical Computer Science» more TCS 1998»

Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete

13 years 9 months ago

Download reference.kfupm.edu.sa

The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...

Javier Esparza

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers