Finite loops recognize exactly the regular open languages (Q4571944): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-63165-8_169 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1522490811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasigroups. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4872086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite monoids and the fine structure of <i>NC</i> <sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to Barrington's M-program model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4470490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Incomplete Latin Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A topology for free groups and related groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic automata and context-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A topological approach to a conjecture of Rhodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topologies for the free monoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial closure of group languages and open sets of the Hall topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une topologie du monoide libre / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur mon article ''Une topologie du monoide libre'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernel of monoid morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite monoids having only trivial subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-sided wreath product of categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: General context-free recognition in less than cubic time / rank
 
Normal rank

Latest revision as of 01:29, 16 July 2024

scientific article; zbMATH DE number 6898367
Language Label Description Also known as
English
Finite loops recognize exactly the regular open languages
scientific article; zbMATH DE number 6898367

    Statements

    Finite loops recognize exactly the regular open languages (English)
    0 references
    0 references
    0 references
    0 references
    4 July 2018
    0 references

    Identifiers