Geometrical regular languages and linear Diophantine equations: the strongly connected case (Q443737)
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: Geometrical regular languages and linear Diophantine equations: the strongly connected case |
scientific article; zbMATH DE number 6065029
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Geometrical regular languages and linear Diophantine equations: the strongly connected case |
scientific article; zbMATH DE number 6065029 |
Statements
Geometrical regular languages and linear Diophantine equations: the strongly connected case (English)
0 references
13 August 2012
0 references
regular language
0 references
minimal deterministic automaton
0 references
Parikh image
0 references
geometrical language
0 references
Diophantine equation
0 references
0 references
0.9672441482543944
0 references
0.7459089756011963
0 references
0.7393482327461243
0 references
0.7378526926040649
0 references
