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 OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4132170 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Discrete Geometry for Computer Imagery / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear Automaton Transformations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Context-Free Languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3651209 / rank | |||
Normal rank | |||
Latest revision as of 02:17, 29 June 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
0 references
