Skip to content
Open Access
  • Home
  • Collections
    • High Impact Articles
    • Jawi Collection
    • Malay Medicine
    • Forensic
  • Search Options
    • UiTM Open Access
    • Search by UiTM Scopus
    • Advanced Search
    • Search by Category
  • Discovery Service
    • Sources
    • UiTM Journals
    • List UiTM Journal in IR
    • Statistic
  • About
    • Open Access
    • Creative Commons Licenses
    • COKI | Malaysia Open Access
    • User Guide
    • Contact Us
    • Search Tips
    • FAQs
Advanced
  • Constructing minimal acyclic d...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Constructing minimal acyclic deterministic finite automata

Constructing minimal acyclic deterministic finite automata

This thesis is submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Ph.D) in the FASTAR group of the Department of Computer Science, University of Pretoria, South Africa. I present a number of algorithms for constructing minimal acyclic deterministic finite au...

Full description

Bibliographic Details
Main Author: Watson, Bruce William
Other Authors: Kourie, Derrick G.
Published: University of Pretoria 2013
Subjects:
Acyclic finite automata
Minimization
Taxonomy
Algorithmics
Correctness-by-construction
UCTD
Online Access:http://hdl.handle.net/2263/23648
Watson, BW 2010, Constructing minimal acyclic deterministic finite automata, PhD thesis, University of Pretoria, Pretoria, viewed yymmdd < http://hdl.handle.net/2263/23648 >
http://upetd.up.ac.za/thesis/available/etd-03302011-195620/
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://hdl.handle.net/2263/23648
Watson, BW 2010, Constructing minimal acyclic deterministic finite automata, PhD thesis, University of Pretoria, Pretoria, viewed yymmdd < http://hdl.handle.net/2263/23648 >
http://upetd.up.ac.za/thesis/available/etd-03302011-195620/

Similar Items

  • Towards cache optimization in finite automata implementations
    by: Ketcha Ngassam, Ernest
    Published: (2013)
  • An Assessment of Algorithms for Deriving Failure Deterministic Finite Automata
    by: Madoda Nxumalo, et al.
    Published: (2017-07-01)
  • Efficient Implementation for Deterministic Finite Tree Automata Minimization
    by: Younes Guellouma, et al.
    Published: (2016-12-01)
  • Computing the weight of subtasks in state minimization of nondeterministic finite automata by the branch and bound method
    by: M.E. Abramyan
    Published: (2021-09-01)
  • Reduction Techniques for Finite (Tree) Automata
    by: Kaati, Lisa
    Published: (2008)

© 2020 | Services hosted by the Perpustakaan Tun Abdul Razak, | Universiti Teknologi MARA | Disclaimer


Loading...
Cannot write session to /tmp/vufind_sessions/sess_ut5q08c9l5kp42bvt9nptddsh3