External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages

Janusz A. Brzozowski, Corwin Sinnamon. Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages. Journal of Automata, Languages and Combinatorics, 22(1-3):29-59, 2017.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on