An application of the Ehrenfeucht-Fraisse game in formal language theory (Q3347321): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2275471570 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The dot-depth hierarchy of star-free languages is infinite / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dot-depth of star-free events / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4132170 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5659497 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5641083 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5184421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3776657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3949052 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A generalization of the Schützenberger product of finite monoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classifying regular events in symbolic logic / rank | |||
Normal rank |
Latest revision as of 16:02, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An application of the Ehrenfeucht-Fraisse game in formal language theory |
scientific article |
Statements
An application of the Ehrenfeucht-Fraisse game in formal language theory (English)
0 references
1984
0 references
star-free languages
0 references
dot-depth hierarchy
0 references
prefix types of first order formulas
0 references