Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (Q6114868): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1142/s0129054122410040 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1142/S0129054122410040 / rank | |||
Normal rank | |||
Latest revision as of 18:35, 30 December 2024
scientific article; zbMATH DE number 7726984
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata |
scientific article; zbMATH DE number 7726984 |
Statements
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (English)
0 references
15 August 2023
0 references
reversible regular languages
0 references
reversible automaton
0 references
forbidden pattern
0 references
reduced reversible automaton
0 references
NL-completeness
0 references
descriptional complexity
0 references
