Primitivity, Uniform Minimality, and State Complexity of Boolean Operations

Published 2018 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Primitivity, Uniform Minimality, and State Complexity of Boolean Operations
Authors
Keywords
State complexity, Finite automaton, Primitive group, Uniformly minimal, Boolean operation, Transition monoid
Journal
THEORY OF COMPUTING SYSTEMS
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2018-03-26
DOI
10.1007/s00224-018-9859-0
References
View 8 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

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.