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.

State Complexity of Combined Operations for Prefix-Free Regular Languages

Hae-Sung Eom, Yo-Sub Han, Kai Salomaa, Sheng Yu. State Complexity of Combined Operations for Prefix-Free Regular Languages. In Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, editors, Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005). pages 137-151, The Publishing House of the Romanian Academy, 2014.

Abstract

Abstract is missing.

runs on