Rozhodování pravdivosti formulí Presburgerovy aritmetiky pomocí konečných automatů
Loading...
Downloads
2
Date issued
Authors
Fluksa, Tomáš
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoká škola báňská - Technická univerzita Ostrava
Location
Signature
Abstract
The bachelor thesis deals with possibility to decide truth of formulas of Presburger arithmetic using finite automata. In first chapter is general description of Presburger arithmetic and specification of problem. Next chapter goes in for study of finite automata, operations over these automata and their utilization for reaching aim of this work. Last chapter describes the computer program, from reading input formula through its processing by using finite automata to final evaluation of truth.
Description
Import 29/09/2010
Subject(s)
Presburger arithmetic, deterministic finite automaton, nondeterministic finite automaton, lexical analysis, syntactic analysis, Java