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.

Approximate NFA Universality Motivated by Information Theory

Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis. Approximate NFA Universality Motivated by Information Theory. In Yo-Sub Han, György Vaszil, editors, Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings. Volume 13439 of Lecture Notes in Computer Science, pages 142-154, Springer, 2022. [doi]

Authors

Stavros Konstantinidis

This author has not been identified. Look up 'Stavros Konstantinidis' in Google

Mitja Mastnak

This author has not been identified. Look up 'Mitja Mastnak' in Google

Nelma Moreira

This author has not been identified. Look up 'Nelma Moreira' in Google

Rogério Reis

This author has not been identified. Look up 'Rogério Reis' in Google
runs on