Concise representations of regular languages by degree and probabilistic finite automata (Q3142004)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Concise representations of regular languages by degree and probabilistic finite automata |
scientific article; zbMATH DE number 440097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concise representations of regular languages by degree and probabilistic finite automata |
scientific article; zbMATH DE number 440097 |
Statements
Concise representations of regular languages by degree and probabilistic finite automata (English)
0 references
9 December 1993
0 references
degree automata
0 references
finite automata
0 references
regular languages
0 references
probabilistic automata
0 references
0 references
0 references
0.9008424
0 references
0.88626814
0 references
