Please use this identifier to cite or link to this item:
|Title:||The complexity of verbal languages over groups|
|Authors:||Jain, S. |
Thurston Automatic Groups
|Citation:||Jain, S., Miasnikov, A., Stephan, F. (2012). The complexity of verbal languages over groups. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012 : 405-414. ScholarBank@NUS Repository. https://doi.org/10.1109/LICS.2012.50|
|Abstract:||This paper investigates the complexity of verbal languages and pattern languages of Thurston automatic groups in terms of the Chomsky hierarchy. Here the language generated by a pattern is taken as the set of representatives of all strings obtained when chosing values for the various variables. For noncommutative free groups, it is shown that the complexity of the verbal and pattern languages (in terms of level on the Chomsky hierarchy) does not depend on the Thurston automatic representation and that verbal languages cannot be context-free (unless they are either the empty word or the full group). They can however be indexed languages. Furthermore, it is shown that in the general case, it might depend on the exactly chosen Thurston automatic representation which level a verbal language takes in the Chomsky hierarchy. There are examples of groups where, in an appropriate representation, all pattern languages are regular or context-free, respectively. © 2012 IEEE.|
|Source Title:||Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 20, 2019
WEB OF SCIENCETM
checked on Mar 11, 2019
checked on Feb 2, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.