Max-product grammars and languages

DOI10.1016/0020-0255(75)90015-8zbMath0335.68058OpenAlexW2008215073MaRDI QIDQ1229591

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)90015-8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A formal power series approach to the construction of minimal fuzzy automata ⋮ FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION ⋮ Homomorphisms of fuzzy recognizers ⋮ Fuzzy automata and languages

Cites Work

• Unnamed Item
• Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
• L-fuzzy sets
• Some definitional suggestions for automata theory
• Max-product machines
• Fuzzy sets
• Maximin automata
• Generalized Automata and Stochastic Languages
• Probabilistic and weighted grammars
• Studies in abstract families of languages
• Probabilistic grammars and automata
• Regular probabilistic languages