Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
ITHEA Classification Structure > F. Theory of Computation  > F.1 COMPUTATION BY ABSTRACT DEVICES  > F.1.1 Models of Computation 
AUTOMATA–BASED METHOD FOR SOLVING SYSTEMS OF LINEAR CONSTRAINTS IN {0,1}
By: Krivoi et al. (3883 reads)
Rating: (1.00/10)

Abstract: We consider a finite state automata based method of solving a system of linear Diophantine equations with coefficients from the set {-1,0,1} and solutions in {0,1}.

Keywords: system of the linear Diophantine equations, set of the basis solutions, outputless finite state automaton.

ACM Classification Keywords: F.1.1 Models of Computation - finite automata, systems of linear Diophantine constraints

Link:

AUTOMATA–BASED METHOD FOR SOLVING SYSTEMS OF LINEAR CONSTRAINTS IN {0,1}

Sergey Krivoi, Lyudmila Matvyeyeva, Wioletta Grzywacz

http://www.foibg.com/ijita/vol12/ijita12-4-p10.pdf

Print
F.1.1 Models of Computation
article: ALGORITHMIZATION PROCESS FOR FRACTAL ANALYSIS IN THE CHAOTIC DYNAMICS OF ... · INTELLIGENT TRADING SYSTEMS · AN ARCHITECTURE FOR REPRESENTING BIOLOGICAL PROCESSES BASED ON NETWORKS... · Polynomial Regression using a Perceptron with Axo-axonic Connections · ACCOUNTING IN THEORETICAL GENETICS · A NEW METHOD FOR THE BINARY ENCODING AND HARDWARE IMPLEMENTATION OF METABOLIC P · GENETIC BASED SPOT DETECTION METHOD IN TWO-DIMENSIONAL ELECTROPHORESIS IMAGES · Self-Organizing Architectural design based on Morphogenetic Programming · PRION CRYSTALIZATION MODEL AND ITS APPLICATION TO RECOGNITION PATTERN · POLYNOMIAL APPROXIMATION USING PARTICLE SWARM OPTIMIZATION OF LINEAR ... · MULTIPLE-MODEL DESCRIPTION AND STRUCTURE DYNAMICS ANALYSIS OF ACTIVE MOVING... · COMPUTATIONAL MODEL FOR SERENDIPITY · STRING MEASURE APPLIED TO STRING SELF-ORGANIZING MAPS AND NETWORKS OF ... · CLASSIFICATION OF DATA TO EXTRACT KNOWLEDGE FROM NEURAL NETWORKS · SIMULTANEOUS CONTROL OF CHAOTIC SYSTEMS USING RBF NETWORKS · TIMED TRANSITION AUTOMATA AS NUMERICAL PLANNING DOMAIN · STATIC ANALYSIS OF USEFULNESS STATES IN TRANSITION P SYSTEMS · GENERALIZING OF NEURAL NETS: FUNCTIONAL NETS OF SPECIAL TYPE · AUTOMATA–BASED METHOD FOR SOLVING SYSTEMS OF LINEAR CONSTRAINTS IN {0,1} · FILTERED NETWORKS OF EVOLUTIONARY PROCESSORS* · NEURAL CONTROL OF CHAOS AND APLICATIONS · SOLVING A DIRECT MARKETING PROBLEM BY THREE TYPES OF ARTMAP NEURAL NETWORKS ·
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.08 secs ]   [ Memory usage: 7.55MB ]   [ GZIP Disabled ]   [ Server load: 0.12 ]
Powered by Tikiwiki CMS/Groupware