Probabilistic grammars and languages

DOI10.1007/s10849-011-9135-zzbMath1259.03042OpenAlexW2069612936MaRDI QIDQ438593

András Kornai

Publication date: 31 July 2012

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: http://eprints.sztaki.hu/7917/

zbMATH Keywords

probabilistic finite automataprobabilistic grammarsprobabilistic languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Uses Software

• TnT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur les rélations rationnelles entre monoides libres
• Mathematical linguistics
• On faces of compact convex sets and their annihilators
• Probabilistic grammars for natural languages
• Minimization of Rational Word Functions
• Formal grammar and information theory: together again?
• Programming Techniques: Regular expression search algorithm
• Probabilistic automata

This page was built for publication: Probabilistic grammars and languages