Informatica logo


Login Register

  1. Home
  2. Issues
  3. Volume 10, Issue 4 (1999)
  4. Decomposition Theorems for Probabilistic ...

Informatica

Information Submit your article For Referees Help ATTENTION!
  • Article info
  • More
    Article info

Decomposition Theorems for Probabilistic Automata over Infinite Objects
Volume 10, Issue 4 (1999), pp. 427–440
Robert D. Reisz  

Authors

 
Placeholder
https://doi.org/10.3233/INF-1999-10405
Pub. online: 1 January 1999      Type: Research Article     

Received
1 October 1999
Published
1 January 1999

Abstract

A probabilistic Büchi automaton PBA is defined. The probabilistic language (L, p) as defined by the PBA is defined. A decomposition theorem similar to the classical Krohn-Rhodes theorem, but for PBA is proved.

PDF XML
PDF XML

Copyright
No copyright data available.

Keywords
probabilistic automata Büchi automata mathematical modelling infinite processes

Metrics
since January 2020
598

Article info
views

0

Full article
views

425

PDF
downloads

197

XML
downloads

Export citation

Copy and paste formatted citation
Placeholder

Download citation in file


Share


RSS

INFORMATICA

  • Online ISSN: 1822-8844
  • Print ISSN: 0868-4952
  • Copyright © 2023 Vilnius University

About

  • About journal

For contributors

  • OA Policy
  • Submit your article
  • Instructions for Referees
    •  

    •  

Contact us

  • Institute of Data Science and Digital Technologies
  • Vilnius University

    Akademijos St. 4

    08412 Vilnius, Lithuania

    Phone: (+370 5) 2109 338

    E-mail: informatica@mii.vu.lt

    https://informatica.vu.lt/journal/INFORMATICA
Powered by PubliMill  •  Privacy policy