Definability by weakly deterministic regular expressions with counters is decidable (Q2946353)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6482749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Definability by weakly deterministic regular expressions with counters is decidable |
scientific article; zbMATH DE number 6482749 |
Statements
Definability by Weakly Deterministic Regular Expressions with Counters is Decidable (English)
0 references
16 September 2015
0 references
0 references
0.8300403952598572
0 references
0.8237668871879578
0 references
0.823531448841095
0 references
0.8199567198753357
0 references
0.8098559975624084
0 references
