Determination of finite automata accepting subregular languages (Q2271457): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2009.05.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010487137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roots of Star Events / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Decompositions of Regular Events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of locally testable events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-entry finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bound of the Number of Threshold Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On NFAs where all states are final, initial, or both / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultimate-Definite and Symmetric-Definite Events and Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Definite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390537 / 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: Q4057601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power-separating regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally testable languages / rank
 
Normal rank

Latest revision as of 20:25, 1 July 2024

scientific article
Language Label Description Also known as
English
Determination of finite automata accepting subregular languages
scientific article

    Statements

    Determination of finite automata accepting subregular languages (English)
    0 references
    0 references
    0 references
    0 references
    7 August 2009
    0 references
    state complexity
    0 references
    determination
    0 references
    subregular languages
    0 references
    finite automata
    0 references

    Identifiers