@ARTICLE{jcss75rat,
   AUTHOR       = {E.D. Sontag},
   JOURNAL      = {J. Comput. System Sci.},
   TITLE        = {On some questions of rationality and decidability},
   YEAR         = {1975},
   OPTMONTH     = {},
   OPTNOTE      = {},
   NUMBER       = {3},
   PAGES        = {375--381},
   VOLUME       = {11},
   KEYWORDS     = {theory of computing and complexity},
   PDF          = {../../FTPDIR/rat-dec.pdf},
   ABSTRACT     = { Some results are given in the theory of rational power 
      series over a broad class of semirings. In particular, it is shown 
      that for unambiguous sets the notion of rationality is independent of 
      the semiring over which representations are defined. The 
      undecidability of the rationality of probabilistic word functions is 
      also established. }
}

{"_id":"8QYuHCdYQRnFCrEpL","bibbaseid":"sontag-onsomequestionsofrationalityanddecidability-1975","downloads":0,"creationDate":"2018-10-18T05:07:06.772Z","title":"On some questions of rationality and decidability","author_short":["Sontag, E."],"year":1975,"bibtype":"article","biburl":"http://www.sontaglab.org/PUBDIR/Biblio/complete-bibliography.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["E.D."],"propositions":[],"lastnames":["Sontag"],"suffixes":[]}],"journal":"J. Comput. System Sci.","title":"On some questions of rationality and decidability","year":"1975","optmonth":"","optnote":"","number":"3","pages":"375–381","volume":"11","keywords":"theory of computing and complexity","pdf":"../../FTPDIR/rat-dec.pdf","abstract":"Some results are given in the theory of rational power series over a broad class of semirings. In particular, it is shown that for unambiguous sets the notion of rationality is independent of the semiring over which representations are defined. The undecidability of the rationality of probabilistic word functions is also established. ","bibtex":"@ARTICLE{jcss75rat,\n AUTHOR = {E.D. Sontag},\n JOURNAL = {J. Comput. System Sci.},\n TITLE = {On some questions of rationality and decidability},\n YEAR = {1975},\n OPTMONTH = {},\n OPTNOTE = {},\n NUMBER = {3},\n PAGES = {375--381},\n VOLUME = {11},\n KEYWORDS = {theory of computing and complexity},\n PDF = {../../FTPDIR/rat-dec.pdf},\n ABSTRACT = { Some results are given in the theory of rational power \n series over a broad class of semirings. In particular, it is shown \n that for unambiguous sets the notion of rationality is independent of \n the semiring over which representations are defined. The \n undecidability of the rationality of probabilistic word functions is \n also established. }\n}\n\n","author_short":["Sontag, E."],"key":"jcss75rat","id":"jcss75rat","bibbaseid":"sontag-onsomequestionsofrationalityanddecidability-1975","role":"author","urls":{},"keyword":["theory of computing and complexity"],"downloads":0,"html":""},"search_terms":["questions","rationality","decidability","sontag"],"keywords":["theory of computing and complexity"],"authorIDs":[],"dataSources":["DKqZbTmd7peqE4THw"]}