On the equivalence and containment problems for unambigous regular expressions, regular grammars and finite automata

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on computing 1985, Vol.14 (3), p.598-611
Hauptverfasser:	STEARNS, R. E, HUNT, H. B. III
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Exact sciences and technology Language theory and syntactical analysis Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	611
container_issue	3
container_start_page	598
container_title	SIAM journal on computing
container_volume	14
creator	STEARNS, R. E HUNT, H. B. III
description
format	Article
fullrecord	<record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_8535576</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>8535576</sourcerecordid><originalsourceid>FETCH-pascalfrancis_primary_85355763</originalsourceid><addsrcrecordid>eNqNzE1LAzEQxvFQLHR9-Q5z8OhCwjZu9yyKNy_ey3SdXVOSyXYmEf32FhHPnh748_BbmcbZwbe9c-7CNNYOfeu7od-YS9WjtW67dV1jygtDeSegUw0fGIlHAuQ3GDMXDJyICyySD5GSwpQFKmM6hDlXBaG5RhSgz0VINWTWu784C6aEoj_aFDiUM1xLTljw2qwnjEo3v3tlbp8eXx-e2wV1xDgJ8hh0v0g4C1_7ne-87--7f96-AbvJUIQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the equivalence and containment problems for unambigous regular expressions, regular grammars and finite automata</title><source>SIAM Journals</source><creator>STEARNS, R. E ; HUNT, H. B. III</creator><creatorcontrib>STEARNS, R. E ; HUNT, H. B. III</creatorcontrib><identifier>ISSN: 0097-5397</identifier><identifier>EISSN: 1095-7111</identifier><language>eng</language><publisher>Philadelphia, PA: Society for Industrial and Applied Mathematics</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Language theory and syntactical analysis ; Theoretical computing</subject><ispartof>SIAM journal on computing, 1985, Vol.14 (3), p.598-611</ispartof><rights>1986 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=8535576$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>STEARNS, R. E</creatorcontrib><creatorcontrib>HUNT, H. B. III</creatorcontrib><title>On the equivalence and containment problems for unambigous regular expressions, regular grammars and finite automata</title><title>SIAM journal on computing</title><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Language theory and syntactical analysis</subject><subject>Theoretical computing</subject><issn>0097-5397</issn><issn>1095-7111</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1985</creationdate><recordtype>article</recordtype><recordid>eNqNzE1LAzEQxvFQLHR9-Q5z8OhCwjZu9yyKNy_ey3SdXVOSyXYmEf32FhHPnh748_BbmcbZwbe9c-7CNNYOfeu7od-YS9WjtW67dV1jygtDeSegUw0fGIlHAuQ3GDMXDJyICyySD5GSwpQFKmM6hDlXBaG5RhSgz0VINWTWu784C6aEoj_aFDiUM1xLTljw2qwnjEo3v3tlbp8eXx-e2wV1xDgJ8hh0v0g4C1_7ne-87--7f96-AbvJUIQ</recordid><startdate>1985</startdate><enddate>1985</enddate><creator>STEARNS, R. E</creator><creator>HUNT, H. B. III</creator><general>Society for Industrial and Applied Mathematics</general><scope>IQODW</scope></search><sort><creationdate>1985</creationdate><title>On the equivalence and containment problems for unambigous regular expressions, regular grammars and finite automata</title><author>STEARNS, R. E ; HUNT, H. B. III</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-pascalfrancis_primary_85355763</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1985</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Language theory and syntactical analysis</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>STEARNS, R. E</creatorcontrib><creatorcontrib>HUNT, H. B. III</creatorcontrib><collection>Pascal-Francis</collection><jtitle>SIAM journal on computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>STEARNS, R. E</au><au>HUNT, H. B. III</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the equivalence and containment problems for unambigous regular expressions, regular grammars and finite automata</atitle><jtitle>SIAM journal on computing</jtitle><date>1985</date><risdate>1985</risdate><volume>14</volume><issue>3</issue><spage>598</spage><epage>611</epage><pages>598-611</pages><issn>0097-5397</issn><eissn>1095-7111</eissn><cop>Philadelphia, PA</cop><pub>Society for Industrial and Applied Mathematics</pub></addata></record>
fulltext	fulltext
identifier	ISSN: 0097-5397
ispartof	SIAM journal on computing, 1985, Vol.14 (3), p.598-611
issn	0097-5397 1095-7111
language	eng
recordid	cdi_pascalfrancis_primary_8535576
source	SIAM Journals
subjects	Applied sciences Computer science control theory systems Exact sciences and technology Language theory and syntactical analysis Theoretical computing
title	On the equivalence and containment problems for unambigous regular expressions, regular grammars and finite automata
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T20%3A35%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20equivalence%20and%20containment%20problems%20for%20unambigous%20regular%20expressions,%20regular%20grammars%20and%20finite%20automata&rft.jtitle=SIAM%20journal%20on%20computing&rft.au=STEARNS,%20R.%20E&rft.date=1985&rft.volume=14&rft.issue=3&rft.spage=598&rft.epage=611&rft.pages=598-611&rft.issn=0097-5397&rft.eissn=1095-7111&rft_id=info:doi/&rft_dat=%3Cpascalfrancis%3E8535576%3C/pascalfrancis%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true