An introduction to formal languages and automata
An introduction to formal languages and automata
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Computing with Membranes: Attacking NP-Complete Problems
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Solving NP-Complete Problems Using P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computing with Membranes: P Systems with Worm-Objects
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Solving the Resolution-Free SAT Problem by Submodel Propagation in Linear Time
Annals of Mathematics and Artificial Intelligence
On the power of membrane division in P systems
Theoretical Computer Science - Words, languages and combinatorics
An improved deterministic local search algorithm for 3-SAT
Theoretical Computer Science
Further remarks on P systems with active membranes, separation, merging, and release rules
Soft Computing - A Fusion of Foundations, Methodologies and Applications
A uniform solution to SAT using membrane creation
Theoretical Computer Science
Three "quantum" algorithms to solve 3-SAT
Theoretical Computer Science
P systems with minimal parallelism
Theoretical Computer Science
Interval-valued computations and their connection with PSPACE
Theoretical Computer Science
Solving SAT in linear time with a neural-like membrane system
IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
Effective computing by interval-values
INES'10 Proceedings of the 14th international conference on Intelligent engineering systems
Quantum Computing
Quantum sequential p systems with unit rules and energy assigned to membranes
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Minimal parallelism for polarizationless p systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
On the efficiency of p systems with active membranes and two polarizations
WMC'04 Proceedings of the 5th international conference on Membrane Computing
P systems with active membranes operating under minimal parallelism
CMC'11 Proceedings of the 12th international conference on Membrane Computing
On the Power of P Systems with Contextual Rules
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
DNA and Membrane Algorithms for SAT
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
| Hi-index | 0.00 |
There are several papers in which SAT is solved in linear time by various new computing paradigms, and specially by various membrane computing systems. In these approaches the used alphabet depends on the number of variables. That gives different classes of the problem by the number of the variables. In this paper we show that the set of valid SAT-formulae and n-SAT-formulae over finite sets of variables are regular languages. We show a construction of deterministic finite automata which accept the SAT and n-SAT languages in conjunctive normal form checking both their syntax and satisfiable evaluations. Thus, theoretically the words of the SAT languages can be accepted in linear time with respect to their lengths by a traditional computer.