Deterministic Half Automata and Boolean Mappings

Authors

  • Adrian Atanasiu Bucharest University Romania

Keywords:

Boole algebra, Boolean mapping, Automata theory.

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.

Author Biography

Adrian Atanasiu, Bucharest University Romania

Math. and Comp. Sci.

Downloads

Published

2014-12-31

Issue

Vol. 1 No. 1 (2014)

Section

Articles

License

Policy for Journals/Articles with Open Access

Authors who publish with this journal agree to the following terms:
    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  1. Authors are permitted and encouraged to post links to their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work

Policy for Journals / Manuscript with Paid Access

Authors who publish with this journal agree to the following terms:
    1. Publisher retain copyright .

  1. Authors are permitted and encouraged to post links to their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work .