Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (Q3602802): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1550295382 / rank | |||
Normal rank | |||
Revision as of 02:09, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) |
scientific article |
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
