| Presentation | 2010-04-22 Elementary Formal Systems with Nonterminal Symbols Tomohiko KOIDE, Ayumi SHINOHARA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Elementary Formal Systems (EFS) are logic programs over strings, and they are useful to describe various language classes in formal language theory. In this paper, we introduce nonterminal symbols to EFS and study their description powers. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | elementary formal systems / formal languages / finite automata |
| Paper # | COMP2010-7 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2010/4/15(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Elementary Formal Systems with Nonterminal Symbols |
| Sub Title (in English) | |
| Keyword(1) | elementary formal systems |
| Keyword(2) | formal languages |
| Keyword(3) | finite automata |
| 1st Author's Name | Tomohiko KOIDE |
| 1st Author's Affiliation | Tohoku University() |
| 2nd Author's Name | Ayumi SHINOHARA |
| 2nd Author's Affiliation | Tohoku University |
| Date | 2010-04-22 |
| Paper # | COMP2010-7 |
| Volume (vol) | vol.110 |
| Number (no) | 12 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |