Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Janusz A. Brzozowski / rank
Normal rank
 
Property / author
 
Property / author: Janusz A. Brzozowski / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978707564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2819381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5740416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages / 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: Q5542138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical finite transformation semigroups. An introduction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of basic operations on suffix-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655366 / 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: Some remarks on the combinatorics of \(\mathcal{IS}_n\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Automaton Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Enumeration of Trees by Height and Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forests of labeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731279 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:52, 5 July 2024

scientific article
Language Label Description Also known as
English
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
scientific article

    Statements

    Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2012
    0 references
    bifix-free
    0 references
    factor-free
    0 references
    finite automaton
    0 references
    monoid
    0 references
    prefix-free
    0 references
    regular language
    0 references
    reversal
    0 references
    semigroup
    0 references
    suffix-free
    0 references
    syntactic complexity
    0 references

    Identifiers