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.
Issue title: Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Article type: Research Article
Authors: Gao, Yuan | Yu, Sheng
Affiliations: Department of Computer Science, The University of Western Ontario, London, Ontario, Canada N6A 5B7, [email protected] | Department of Computer Science, The University of Western Ontario, London, Ontario, Canada N6A 5B7, [email protected]
Note: [] Address for correspondence: Department of Computer Science, The University of Western Ontario, London, Ontario, Canada N6A 5B7
Abstract: In this paper, we study the state complexities of four combined operations: L*1 ∪ L2, L*1 ∩ L2, LR1 ∪ L2, and LR1 ∩ L2. The tight bounds for all these combined operations on regular languages are obtained and proved. We show that, as usual, they are different from the mathematical compositions of the state complexities of their individual participating operations.
Keywords: state complexity, combined operations, regular languages, finite automata
DOI: 10.3233/FI-2012-670
Journal: Fundamenta Informaticae, vol. 116, no. 1-4, pp. 79-92, 2012
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
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
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]