Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (Q3602802)
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: Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) |
scientific article; zbMATH DE number 5507742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) |
scientific article; zbMATH DE number 5507742 |
Statements
Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (English)
0 references
12 February 2009
0 references
finite automata
0 references
regular languages
0 references
minimal automaton
0 references
geometrical language
0 references
geometricity test
0 references
temporal validation
0 references
0 references
0.9601094126701356
0 references
0.9415046572685242
0 references
0.8181775808334351
0 references
0.7393482327461243
0 references
0.7359117865562439
0 references
