doi.org/10.1007/978-1-4612-1844-9_10
Preview meta tags from the doi.org website.
Linked Hostnames
18- 11 links towww.springernature.com
- 10 links tolink.springer.com
- 5 links todoi.org
- 3 links tocitation-needed.springer.com
- 3 links tosupport.springernature.com
- 1 link toauthorservices.springernature.com
- 1 link toidp.springer.com
- 1 link tolink.springernature.com
Thumbnail
Search Engine Appearance
Kleene Algebra and Regular Expressions
In Lecture 9, we gave a combinatorial proof that every finite automaton has an equivalent regular expression. Here is an algebraic proof that generalizes that argument. It is worth looking at because it introduces the notion of Kleene algebra and the use of matrices....
Bing
Kleene Algebra and Regular Expressions
In Lecture 9, we gave a combinatorial proof that every finite automaton has an equivalent regular expression. Here is an algebraic proof that generalizes that argument. It is worth looking at because it introduces the notion of Kleene algebra and the use of matrices....
DuckDuckGo
https://doi.org/10.1007/978-1-4612-1844-9_10Kleene Algebra and Regular Expressions
In Lecture 9, we gave a combinatorial proof that every finite automaton has an equivalent regular expression. Here is an algebraic proof that generalizes that argument. It is worth looking at because it introduces the notion of Kleene algebra and the use of matrices....
General Meta Tags
28- titleKleene Algebra and Regular Expressions | SpringerLink
- charsetUTF-8
- X-UA-CompatibleIE=edge
- viewportwidth=device-width, initial-scale=1
- applicable-devicepc,mobile
Open Graph Meta Tags
6- og:urlhttps://link.springer.com/chapter/10.1007/978-1-4612-1844-9_10
- og:typePaper
- og:site_nameSpringerLink
- og:titleKleene Algebra and Regular Expressions
- og:descriptionIn Lecture 9, we gave a combinatorial proof that every finite automaton has an equivalent regular expression. Here is an algebraic proof that generalizes that argument. It is worth looking at because it introduces the notion of Kleene algebra and the use of matrices....
Twitter Meta Tags
6- twitter:siteSpringerLink
- twitter:cardsummary
- twitter:image:altContent cover image
- twitter:titleKleene Algebra and Regular Expressions
- twitter:descriptionIn Lecture 9, we gave a combinatorial proof that every finite automaton has an equivalent regular expression. Here is an algebraic proof that generalizes that argument. It is worth looking at because it introduces the notion of Kleene algebra and the use of matrices....
Item Prop Meta Tags
3- position1
- position2
- position3
Link Tags
9- apple-touch-icon/oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png
- canonicalhttps://link.springer.com/chapter/10.1007/978-1-4612-1844-9_10
- icon/oscar-static/img/favicons/darwin/android-chrome-192x192.png
- icon/oscar-static/img/favicons/darwin/favicon-32x32.png
- icon/oscar-static/img/favicons/darwin/favicon-16x16.png
Links
45- http://scholar.google.co.uk/scholar?as_q=&num=10&btnG=Search+Scholar&as_epq=&as_oq=&as_eq=&as_occt=any&as_sauthors=%22Dexter%20C.%20Kozen%22&as_publication=&as_ylo=&as_yhi=&as_allsubj=all&hl=en
- http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?cmd=search&term=Dexter%20C.%20Kozen
- https://authorservices.springernature.com/go/sn/?utm_source=SNLinkfooter&utm_medium=Web&utm_campaign=SNReferral
- https://citation-needed.springer.com/v2/references/10.1007/978-1-4612-1844-9_10?format=bibtex&flavour=citation
- https://citation-needed.springer.com/v2/references/10.1007/978-1-4612-1844-9_10?format=endnote&flavour=citation