The single loop representations of regular languages (Q1383380): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: H-bounded and semi-discrete languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-discrete context-free languages<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equation \(a_ M=b^ Nc^ P\) in a free group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thin and slender languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numeration systems, linear recurrences, and regular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered catenation and regular free disjunctive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular component splittable languages / rank
 
Normal rank

Latest revision as of 12:02, 28 May 2024

scientific article
Language Label Description Also known as
English
The single loop representations of regular languages
scientific article

    Statements

    The single loop representations of regular languages (English)
    0 references
    0 references
    0 references
    13 April 1998
    0 references
    0 references
    regular language
    0 references
    fs-representable language
    0 references