A formal model of computing with words

Ying, M

A formal model of computing with words

Ying, M

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Fuzzy Systems, 2002, 10 (5), pp. 640 - 652
Issue Date:: 2002-10-01

Closed Access

	Filename	Description	Size
	2008004737OK.pdf		400.69 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X	en_US
dc.date.issued	2002-10-01	en_US
dc.identifier.citation	IEEE Transactions on Fuzzy Systems, 2002, 10 (5), pp. 640 - 652	en_US
dc.identifier.issn	1063-6706	en_US
dc.identifier.uri	http://hdl.handle.net/10453/9099
dc.description.abstract	Classical automata are formal models of computing with values. Fuzzy automata are generalizations of classical automata where the knowledge about the system's next state is vague or uncertain. It is worth noting that like classical automata, fuzzy automata can only process strings of input symbols. Therefore, such fuzzy automata are still (abstract) devices for computing with values, although a certain vagueness or uncertainty are involved in the process of computation. In this paper, we introduce a new kind of fuzzy automata whose inputs are instead strings of fuzzy subsets of the input alphabet. These new fuzzy automata may serve as formal models of computing with words. We establish an extension principle from computing with values to computing with words. This principle indicates that computing with words can be implemented with computing with values with the price of a big amount of extra computations.	en_US
dc.relation.ispartof	IEEE Transactions on Fuzzy Systems	en_US
dc.relation.isbasedon	10.1109/TFUZZ.2002.803497	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	A formal model of computing with words	en_US
dc.type	Journal Article
utslib.citation.volume	5	en_US
utslib.citation.volume	10	en_US
utslib.for	080199 Artificial Intelligence and Image Processing not elsewhere classified	en_US
utslib.for	080203 Computational Logic and Formal Languages	en_US
utslib.for	020603 Quantum Information, Computation and Communication	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.issue	5	en_US
pubs.publication-status	Published	en_US
pubs.volume	10	en_US

Abstract:

Classical automata are formal models of computing with values. Fuzzy automata are generalizations of classical automata where the knowledge about the system's next state is vague or uncertain. It is worth noting that like classical automata, fuzzy automata can only process strings of input symbols. Therefore, such fuzzy automata are still (abstract) devices for computing with values, although a certain vagueness or uncertainty are involved in the process of computation. In this paper, we introduce a new kind of fuzzy automata whose inputs are instead strings of fuzzy subsets of the input alphabet. These new fuzzy automata may serve as formal models of computing with words. We establish an extension principle from computing with values to computing with words. This principle indicates that computing with words can be implemented with computing with values with the price of a big amount of extra computations.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/9099