Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information
Authors
Keywords
Algorithms, Directed graphs, Grammar, Image analysis, Engineering and technology, Information theory, Speech, Topology
Journal
PLoS One
Volume 11, Issue 11, Pages e0165864
Publisher
Public Library of Science (PLoS)
Online
2016-11-03
DOI
10.1371/journal.pone.0165864
References
View 3 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.