| dc.contributor.author | Abu Ayyash, Mohammed | |
| dc.contributor.author | Rodaro, Emanuele | |
| dc.date.accessioned | 2018-09-14T10:35:06Z | |
| dc.date.available | 2018-09-14T10:35:06Z | |
| dc.date.issued | 2016 | |
| dc.identifier.uri | http://dspace.bethlehem.edu:8080/xmlui/handle/123456789/66 | |
| dc.description.abstract | We prove that the Schutzenberger graph of any element of the HNN-extension of a fnite inverse semigroup S with respect to its standard presentation is a context-free graph, showing that the language L recognized by this automaton is context-free. Finally we explicitly construct the grammar generating L, and from this fact we show that the word problem for an HNN-extension of a fnite inverse semigroup S is decidable and lies in the complexity class of polynomial time problems. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | PUBLICATIONS DE L'INSTITUT MATHEMATIQUE | en_US |
| dc.relation.ispartofseries | Nouvelle serie, tome;DOI: 10.2298/PIM141227016A | |
| dc.subject | inverse semigroup, Schutzenberger automaton, context-free language. | en_US |
| dc.title | CONTEXT-FREENESS OF THE LANGUAGES OF SCH UTZENBERGER AUTOMATA OF HNN-EXTENSIONS OF FINITE INVERSE SEMIGROUPS | en_US |
| dc.type | Article | en_US |
