Realizations of fuzzy languages by probabilistic, max-product, and maximin automata

DOI10.1016/0020-0255(75)90004-3zbMath0313.68063OpenAlexW2042991671MaRDI QIDQ1220389

Eugene S. Santos

Publication date: 1975

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(75)90004-3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to information and communication theory (94-00)

Related Items (11)

A formal power series approach to the construction of minimal fuzzy automata ⋮ Probabilistic automata ⋮ Applications of a group in general fuzzy automata ⋮ The lattice-valued Turing machines and the lattice-valued type 0 grammars ⋮ Results on the use of category theory for the study of lattice-valued finite state machines ⋮ On equality between fuzzy context-free and fuzzy adult 0L languages ⋮ Homomorphisms of fuzzy recognizers ⋮ Max-product grammars and languages ⋮ Fuzzy automata and languages ⋮ Fuzzy recognizers and recognizable sets ⋮ Regular grammars with truth values in lattice-ordered monoid and their languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fuzzy Sequential Functions
• Fuzzy sets
• Fuzzy events realized by finite probabilistic automata
• Maximin automata
• Probabilistic automata
• Maximin sequential-like machines and chains
• Functions of Finite Markov Chains

This page was built for publication: Realizations of fuzzy languages by probabilistic, max-product, and maximin automata