Overview

Web-SynDic stands for web-based demonstration and test of the syntactic algorithms for solving linear Diophantine equations in nonnegative integers. These algorithms, developed at CS Department of PetrSU, are a novel type of algorithms for efficient solving some classes of nonnegative linear Diophantine equations (NLDE or LDE in nonnegative integers) by syntactic (parsing) methods.

These syntactic algorithms seem to be promising tool for solving some classes of NLDE system; more exactly a class of NLDE system, associated with formal grammars (ANLDE systems). For this class the syntactic algorithms allow efficient (polynomial and pseudo-polynomial) computations comparing with the general NLDE case when the same computational problems are NP-complete or even overNP [9].

A user just sends a test ANLDE system to Web-SynDic; the latter responds with the solution and some characteristics of the computation. This allows to present the key features of the syntactic algorithms, test them, estimate the efficiency, etc.

A user is assumed to be a researcher in Diophantine analysis, formal grammars, integer programming, and related fields. She/He has an access to the Internet via a standard browser.

Note, that the web system does not allow a user to have a direct access to the demonstrated&tested algorithms but shows only the outcome of their work. Detailed information about the syntactic algorithms and ANLDE theory can be found in [1,2,6,7].