State Complexity of Combined Operations for Suffix-free Regular Languages
| dc.contributor.author | Rohilla, Darvena | |
| dc.contributor.supervisor | Kumar, Ajay | |
| dc.date.accessioned | 2012-08-07T05:21:16Z | |
| dc.date.available | 2012-08-07T05:21:16Z | |
| dc.date.issued | 2012-08-07T05:21:16Z | |
| dc.description.abstract | A regular expression is a pattern that describes a set of strings of particular type described by finite automata. Regular languages are classified into prefix-free, suffix-free, infix-free languages. Study of state complexity is strongly motivated by applications of finite automata in software engineering, programming languages, natural language, speech processing and other practical areas. Since many of these applications use automata of large sizes, it is important to know the size of automata which is defined by the number of states in the automata. Number of states in the DFA accepting the language defines the state complexity of languages. Recently researchers have studied the state complexities of prefix free regular languages for individual and combined operations and suffix-free regular languages for individual operations. This thesis focuses on estimating the state complexities of combined operations for suffixfree regular languages. iii | en |
| dc.format.extent | 1276367 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10266/1831 | |
| dc.language.iso | en | en |
| dc.subject | suffix-free regular language | en |
| dc.subject | Complexity | en |
| dc.title | State Complexity of Combined Operations for Suffix-free Regular Languages | en |
| dc.type | Thesis | en |