Regular languages: to finite automata and beyond (invited talk) (Q6587262)
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: Regular languages: to finite automata and beyond (invited talk) |
scientific article; zbMATH DE number 7896680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regular languages: to finite automata and beyond (invited talk) |
scientific article; zbMATH DE number 7896680 |
Statements
Regular languages: to finite automata and beyond (invited talk) (English)
0 references
13 August 2024
0 references
regular languages
0 references
descriptional complexity
0 references
finite automata
0 references
0.8520635962486267
0 references
0.7997339367866516
0 references
0.7988649010658264
0 references
0.7988646626472473
0 references
