Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Dąbrowski, Robert | Plandowski, Wojciech
Affiliations: Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warszawa, Poland. robert.dabrowski@mimuw.edu.pl, wojtekpl@mimuw.edu.pl
Note: [] Address for correspondence: Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warszawa, Poland.
Abstract: We describe an intersection of the family of expressible relations and another natural family of relations. This is the first result of this kind existing in the literature. To obtain it we extend a tool for proving nonexpressibility of languages to a tool for proving nonexpressibility of relations.
Keywords: combinatorics on words, word equations, expressible relations
DOI: 10.3233/FI-2015-1215
Journal: Fundamenta Informaticae, vol. 138, no. 3, pp. 339-350, 2015
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl