AUTOMATIC AND TRANSDUCER REDUCIBILITY BETWEEN CONTEXT FREE LANGUAGES
Bachelor's
Saved in:
Main Author: | HOW SI WEI |
---|---|
Other Authors: | MATHEMATICS |
Published: |
2021
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/202262 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Regular patterns, regular languages and context-free languages
by: Jain, S., et al.
Published: (2013) -
Reducibilities between Regular Languages
by: TAN WAI YEAN
Published: (2011) -
TRANSDUCED LEARNERS
by: KUEK SHAO NING
Published: (2021) -
P transducers
by: Ciobanu, G., et al.
Published: (2013) -
REGULAR AND CONTEXT-FREE LANGUAGES AND THEIR CLOSURE PROPERTIES WITH RESPECT TO SPECIFIC MANY-ONE REDUCTIONS
by: ZHANG JIANGWEI
Published: (2021)