Probabilistic asynchronous automata (Q4864443): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An extension of the notions of traces and of asynchronous automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membership problems for regular and context-free trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems of commutation and rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics on traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On m-adic probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on finite asynchronous automata / rank
 
Normal rank

Latest revision as of 10:48, 24 May 2024

scientific article; zbMATH DE number 845884
Language Label Description Also known as
English
Probabilistic asynchronous automata
scientific article; zbMATH DE number 845884

    Statements