Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of locally testable events / 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: Q3484371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time algorithm for the local testability problem of deterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Order of a Locally Testable Automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular locally testable semigroups as semigroups of quasi-ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3123631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Definite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The varieties of n-testable semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally testable semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally testable languages / rank
 
Normal rank

Latest revision as of 15:33, 29 May 2024

scientific article
Language Label Description Also known as
English
Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
scientific article

    Statements

    Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (English)
    0 references
    0 references
    4 June 2000
    0 references

    Identifiers