Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method

DOI10.1007/978-3-642-39212-2_20zbMath1334.68111arXiv1302.6411OpenAlexW2097220472MaRDI QIDQ5327434

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart

Publication date: 7 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.6411

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Quantitative Verification of Stochastic Regular Expressions

This page was built for publication: Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method