Journal of Computer Science Technology Updates  (Volume 1 Issue 1)

 Deterministic Half Automata and Boolean Mappings Jcstu
Pages 35-40

Adrian Atanasiu

DOI: http://dx.doi.org/10.15379/2410-2938.2014.01.01.05

Published: 24 December 2014

Abstract
The paper establishes a correspondence between the class of deterministic half automata with at most states and at most input characters, and the class of boolean mappings defined over a basic Boole algebra. In this correspondence all main properties of each concept (boolean mapping and half-automaton respectively) are preserved by the other concept.
Keywords
Boole algebra, Boolean mapping, Automata theory.
CTDL

Testimonials

SiteLock