Syntactic complexity of bifix-free languages (Q2399256): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2765640867 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1604.06936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3653240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2819381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5178449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Aperiodic Semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bound on Syntactic Complexity of Suffix-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of átomata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic Complexity of Ideal and Closed Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of bifix-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deterministic finite automata and syntactic monoid size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic complexity of bifix-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731279 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:53, 14 July 2024

scientific article
Language Label Description Also known as
English
Syntactic complexity of bifix-free languages
scientific article

    Statements

    Identifiers