Probabilistic automata complexity of languages depends on language structure and error probability

New lower bound of complexity for probabilistic automata with error bounded probability was proved. It depends on the language structure and on error probability of recognition. It is shown that for languages which are "rich" with formulated property a new lower bound of probabilistic comp...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Ablayev, Farid M.
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Error Probability Language Versus Probabilistic Algorithm Probabilistic Complexity Regular Language
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	161
container_issue
container_start_page	154
container_title
container_volume
creator	Ablayev, Farid M.
description	New lower bound of complexity for probabilistic automata with error bounded probability was proved. It depends on the language structure and on error probability of recognition. It is shown that for languages which are "rich" with formulated property a new lower bound of probabilistic complexity is more precise than that of Rabin's lower bound. In addition with the help of a new lower bound we improve the hierarchy of complexity of probabilistic automata depending on error probability previously shown by the author.
doi_str_mv	10.1007/BFb0017138
format	Book Chapter
fullrecord	<record><control><sourceid>springer</sourceid><recordid>TN_cdi_springer_books_10_1007_BFb0017138</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>springer_books_10_1007_BFb0017138</sourcerecordid><originalsourceid>FETCH-LOGICAL-s188t-b0d0f4b4319471ccb4b3b878479ce47e8046a3d8ba6e099a5bad7fb1e1a832a13</originalsourceid><addsrcrecordid>eNpFkEtLxDAUheMLHMfZ-AuydFO9t0mbdKmDo8KALhRmV27atFQ7TUlScP69yvg4mwPnwLf4GLtAuEIAdX27MgCoUOgDdiYyCTIr0nxzyGaYIyZCyOJof2SACJtjNgMBaVIoKU7ZIoQ3-IpIZZ7pGTPP3hkyXd-F2FWcpui2FIlXbjv29qOLO-4a3tPQTtTawGs72qEO3A1_Iw_RT1WcvOU01Nx67zwff7Fxd85OGuqDXfz0nL2u7l6WD8n66f5xebNOAmodEwM1NNJIgYVUWFVGGmG00lIVlZXKapA5iVobyi0UBWWGatUYtEhapIRizi733DD6bmitL41z76FEKL_Flf_ixCc_yl4g</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Probabilistic automata complexity of languages depends on language structure and error probability</title><source>Springer Books</source><creator>Ablayev, Farid M.</creator><contributor>Chytil, Michal P. ; Koubek, Václav ; Janiga, Ladislav</contributor><creatorcontrib>Ablayev, Farid M. ; Chytil, Michal P. ; Koubek, Václav ; Janiga, Ladislav</creatorcontrib><description>New lower bound of complexity for probabilistic automata with error bounded probability was proved. It depends on the language structure and on error probability of recognition. It is shown that for languages which are "rich" with formulated property a new lower bound of probabilistic complexity is more precise than that of Rabin's lower bound. In addition with the help of a new lower bound we improve the hierarchy of complexity of probabilistic automata depending on error probability previously shown by the author.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 354050110X</identifier><identifier>ISBN: 9783540501107</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 354045926X</identifier><identifier>EISBN: 9783540459262</identifier><identifier>DOI: 10.1007/BFb0017138</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Error Probability ; Language Versus ; Probabilistic Algorithm ; Probabilistic Complexity ; Regular Language</subject><ispartof>Mathematical Foundations of Computer Science 1988, 1988, p.154-161</ispartof><rights>Springer-Verlag Berlin Heidelberg 1988</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0017138$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0017138$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>779,780,784,793,27925,38255,41442,42511</link.rule.ids></links><search><contributor>Chytil, Michal P.</contributor><contributor>Koubek, Václav</contributor><contributor>Janiga, Ladislav</contributor><creatorcontrib>Ablayev, Farid M.</creatorcontrib><title>Probabilistic automata complexity of languages depends on language structure and error probability</title><title>Mathematical Foundations of Computer Science 1988</title><description>New lower bound of complexity for probabilistic automata with error bounded probability was proved. It depends on the language structure and on error probability of recognition. It is shown that for languages which are "rich" with formulated property a new lower bound of probabilistic complexity is more precise than that of Rabin's lower bound. In addition with the help of a new lower bound we improve the hierarchy of complexity of probabilistic automata depending on error probability previously shown by the author.</description><subject>Error Probability</subject><subject>Language Versus</subject><subject>Probabilistic Algorithm</subject><subject>Probabilistic Complexity</subject><subject>Regular Language</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>354050110X</isbn><isbn>9783540501107</isbn><isbn>354045926X</isbn><isbn>9783540459262</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>1988</creationdate><recordtype>book_chapter</recordtype><sourceid/><recordid>eNpFkEtLxDAUheMLHMfZ-AuydFO9t0mbdKmDo8KALhRmV27atFQ7TUlScP69yvg4mwPnwLf4GLtAuEIAdX27MgCoUOgDdiYyCTIr0nxzyGaYIyZCyOJof2SACJtjNgMBaVIoKU7ZIoQ3-IpIZZ7pGTPP3hkyXd-F2FWcpui2FIlXbjv29qOLO-4a3tPQTtTawGs72qEO3A1_Iw_RT1WcvOU01Nx67zwff7Fxd85OGuqDXfz0nL2u7l6WD8n66f5xebNOAmodEwM1NNJIgYVUWFVGGmG00lIVlZXKapA5iVobyi0UBWWGatUYtEhapIRizi733DD6bmitL41z76FEKL_Flf_ixCc_yl4g</recordid><startdate>19880101</startdate><enddate>19880101</enddate><creator>Ablayev, Farid M.</creator><general>Springer Berlin Heidelberg</general><scope/></search><sort><creationdate>19880101</creationdate><title>Probabilistic automata complexity of languages depends on language structure and error probability</title><author>Ablayev, Farid M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-s188t-b0d0f4b4319471ccb4b3b878479ce47e8046a3d8ba6e099a5bad7fb1e1a832a13</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>1988</creationdate><topic>Error Probability</topic><topic>Language Versus</topic><topic>Probabilistic Algorithm</topic><topic>Probabilistic Complexity</topic><topic>Regular Language</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ablayev, Farid M.</creatorcontrib></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ablayev, Farid M.</au><au>Chytil, Michal P.</au><au>Koubek, Václav</au><au>Janiga, Ladislav</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Probabilistic automata complexity of languages depends on language structure and error probability</atitle><btitle>Mathematical Foundations of Computer Science 1988</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>1988-01-01</date><risdate>1988</risdate><spage>154</spage><epage>161</epage><pages>154-161</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>354050110X</isbn><isbn>9783540501107</isbn><eisbn>354045926X</eisbn><eisbn>9783540459262</eisbn><abstract>New lower bound of complexity for probabilistic automata with error bounded probability was proved. It depends on the language structure and on error probability of recognition. It is shown that for languages which are "rich" with formulated property a new lower bound of probabilistic complexity is more precise than that of Rabin's lower bound. In addition with the help of a new lower bound we improve the hierarchy of complexity of probabilistic automata depending on error probability previously shown by the author.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/BFb0017138</doi><tpages>8</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0302-9743
ispartof	Mathematical Foundations of Computer Science 1988, 1988, p.154-161
issn	0302-9743 1611-3349
language	eng
recordid	cdi_springer_books_10_1007_BFb0017138
source	Springer Books
subjects	Error Probability Language Versus Probabilistic Algorithm Probabilistic Complexity Regular Language
title	Probabilistic automata complexity of languages depends on language structure and error probability
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T13%3A35%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-springer&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Probabilistic%20automata%20complexity%20of%20languages%20depends%20on%20language%20structure%20and%20error%20probability&rft.btitle=Mathematical%20Foundations%20of%20Computer%20Science%201988&rft.au=Ablayev,%20Farid%20M.&rft.date=1988-01-01&rft.spage=154&rft.epage=161&rft.pages=154-161&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=354050110X&rft.isbn_list=9783540501107&rft_id=info:doi/10.1007/BFb0017138&rft_dat=%3Cspringer%3Espringer_books_10_1007_BFb0017138%3C/springer%3E%3Curl%3E%3C/url%3E&rft.eisbn=354045926X&rft.eisbn_list=9783540459262&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true