AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL (Q3395146)
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 5597928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL |
scientific article; zbMATH DE number 5597928 |
Statements
AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL (English)
0 references
21 August 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.9623816609382628
0 references
0.9601094126701356
0 references
0.8118404150009155
0 references
0.7416380643844604
0 references
0.7284484505653381
0 references
