Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees

Published 2023 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
Authors
Keywords
-
Journal
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Volume 34, Issue 06, Pages 655-690
Publisher
World Scientific Pub Co Pte Ltd
Online
2023-07-17
DOI
10.1142/s0129054123450053
References
View 6 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

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
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.