Consensual languages and matching finite-state computations (Q3006160): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1051/ita/2011012 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2121164581 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Alternation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Consensual Definition of Languages by Regular Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Consensual languages and matching finite-state computations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4190159 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5590814 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5588675 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The equivalence of four extensions of context-free grammars / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/ITA/2011012 / rank | |||
Normal rank | |||
Latest revision as of 08:20, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Consensual languages and matching finite-state computations |
scientific article |
Statements
Consensual languages and matching finite-state computations (English)
0 references
10 June 2011
0 references
formal languages
0 references
finite automata
0 references
consensual languages
0 references
counter machines
0 references
polynomial time parsing
0 references
non-semilinear languages
0 references
Parikh mapping
0 references
descriptive complexity of regular languages
0 references
degree of grammaticality
0 references
