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: Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Article type: Research Article
Authors: Kaminski, Michael | Tan, Tony
Affiliations: Department of Computer Science, Technion – Israel Institute of Technology Haifa 32000, Israel. E-mail: [email protected]
Abstract: It is shown that the emptiness problemfor two-pebble automata languages is undecidable and that two-pebble automata are weaker than three-pebble automata.
Keywords: pebble automata, infinite alphabet, undecidability, Hilbert's tenth problem
DOI: 10.3233/FI-2010-234
Journal: Fundamenta Informaticae, vol. 98, no. 4, pp. 379-390, 2010
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]