Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (Q6114868): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import recommendations run Q6534273
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1142/s0129054122410040 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1142/S0129054122410040 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Q5016363 / rank
 
Normal rank
Property / Recommended article: Q5016363 / qualifier
 
Similarity Score: 0.8643398
Amount0.8643398
Unit1
Property / Recommended article: Q5016363 / qualifier
 
Property / Recommended article
 
Property / Recommended article: A Lower Bound For Reversible Automata / rank
 
Normal rank
Property / Recommended article: A Lower Bound For Reversible Automata / qualifier
 
Similarity Score: 0.8444419
Amount0.8444419
Unit1
Property / Recommended article: A Lower Bound For Reversible Automata / qualifier
 
Property / Recommended article
 
Property / Recommended article: Minimal and Reduced Reversible Automata / rank
 
Normal rank
Property / Recommended article: Minimal and Reduced Reversible Automata / qualifier
 
Similarity Score: 0.8393645
Amount0.8393645
Unit1
Property / Recommended article: Minimal and Reduced Reversible Automata / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4609331 / rank
 
Normal rank
Property / Recommended article: Q4609331 / qualifier
 
Similarity Score: 0.8391688
Amount0.8391688
Unit1
Property / Recommended article: Q4609331 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Minimal Reversible Deterministic Finite Automata / rank
 
Normal rank
Property / Recommended article: Minimal Reversible Deterministic Finite Automata / qualifier
 
Similarity Score: 0.8251255
Amount0.8251255
Unit1
Property / Recommended article: Minimal Reversible Deterministic Finite Automata / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the efficient construction of quasi-reversible automata for reversible languages / rank
 
Normal rank
Property / Recommended article: On the efficient construction of quasi-reversible automata for reversible languages / qualifier
 
Similarity Score: 0.82384974
Amount0.82384974
Unit1
Property / Recommended article: On the efficient construction of quasi-reversible automata for reversible languages / qualifier
 
Property / Recommended article
 
Property / Recommended article: The Degree of Irreversibility in Deterministic Finite Automata / rank
 
Normal rank
Property / Recommended article: The Degree of Irreversibility in Deterministic Finite Automata / qualifier
 
Similarity Score: 0.8235664
Amount0.8235664
Unit1
Property / Recommended article: The Degree of Irreversibility in Deterministic Finite Automata / qualifier
 
Property / Recommended article
 
Property / Recommended article: The Degree of Irreversibility in Deterministic Finite Automata / rank
 
Normal rank
Property / Recommended article: The Degree of Irreversibility in Deterministic Finite Automata / qualifier
 
Similarity Score: 0.8221909
Amount0.8221909
Unit1
Property / Recommended article: The Degree of Irreversibility in Deterministic Finite Automata / qualifier
 
Property / Recommended article
 
Property / Recommended article: Minimal Reversible Deterministic Finite Automata / rank
 
Normal rank
Property / Recommended article: Minimal Reversible Deterministic Finite Automata / qualifier
 
Similarity Score: 0.821089
Amount0.821089
Unit1
Property / Recommended article: Minimal Reversible Deterministic Finite Automata / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4737155 / rank
 
Normal rank
Property / Recommended article: Q4737155 / qualifier
 
Similarity Score: 0.8137741
Amount0.8137741
Unit1
Property / Recommended article: Q4737155 / qualifier
 

Latest revision as of 20:00, 27 January 2025

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
    0 references
    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

    Identifiers