arXiv
Open Access
2015
Quick Brown Fox in Formal Languages
Kazuhiro Inaba
Abstrak
Given a finite alphabet $Σ$ and a deterministic finite automaton on $Σ$, the problem of determining whether the language recognized by the automaton contains any pangram is \NP-complete. Various other language classes and problems around pangrams are analyzed.
Topik & Kata Kunci
Penulis (1)
K
Kazuhiro Inaba
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2015
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓