Concise representations of regular languages by degree and probabilistic finite automata (Q3142004): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:54, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Concise representations of regular languages by degree and probabilistic finite automata |
scientific article |
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
