Rational language: Difference between revisions
Content deleted Content added
m Date maintenance tags and general fixes: build 414: |
Deltahedron (talk | contribs) →References: Berstel & Reutenauer (2011) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{Orphan|date=February 2009}} |
{{Orphan|date=February 2009}} |
||
{{Unreferenced|date=May 2010}} |
|||
In computer science '''rational languages''' are a category of [[formal language]]s. They are defined as the [[set (mathematics)|set]] of strings for which some rational series assigns non-zero values (also known as that series' [[support (mathematics)|support]]). When the [[semiring]] of the rational series is [[boolean logic|boolean]], the associated rational languages are simply the [[regular language]]s. |
In computer science '''rational languages''' are a category of [[formal language]]s. They are defined as the [[set (mathematics)|set]] of strings for which some rational series assigns non-zero values (also known as that series' [[support (mathematics)|support]]). When the [[semiring]] of the rational series is [[boolean logic|boolean]], the associated rational languages are simply the [[regular language]]s. |
||
==References== |
|||
| ⚫ | |||
{{reflist}} |
|||
* {{cite book | zbl=1250.68007 | last1=Berstel | first1=Jean | last2=Reutenauer | first2=Christophe | title=Noncommutative rational series with applications | series=Encyclopedia of Mathematics and Its Applications | volume=137 | location=Cambridge | publisher=[[Cambridge University Press]] | year=2011 | isbn=978-0-521-19022-0 | zbl=1250.68007 }} |
|||
* {{cite book | last=Sakarovitch | first=Jacques | title=Elements of automata theory | others=Translated from the French by Reuben Thomas | location=Cambridge | publisher=[[Cambridge University Press]] | year=2009 | isbn=978-0-521-84425-3 | zbl=1188.68177 }} |
|||
| ⚫ | |||
{{Formalmethods-stub}} |
{{Formalmethods-stub}} |
||
Revision as of 20:05, 23 November 2012
In computer science rational languages are a category of formal languages. They are defined as the set of strings for which some rational series assigns non-zero values (also known as that series' support). When the semiring of the rational series is boolean, the associated rational languages are simply the regular languages.
References
- Berstel, Jean; Reutenauer, Christophe (2011). Noncommutative rational series with applications. Encyclopedia of Mathematics and Its Applications. Vol. 137. Cambridge: Cambridge University Press. ISBN 978-0-521-19022-0. Zbl 1250.68007.
- Sakarovitch, Jacques (2009). Elements of automata theory. Translated from the French by Reuben Thomas. Cambridge: Cambridge University Press. ISBN 978-0-521-84425-3. Zbl 1188.68177.
 | This formal methods-related article is a stub. You can help Wikipedia by expanding it. |