Some algorithms for equivalent transformation of nondeterministic finite automata (Q462609): 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 / author
 
Property / author: B. F. Mel'nikov / rank
Normal rank
 
Property / author
 
Property / author: B. F. Mel'nikov / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q45 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6359316 / rank
 
Normal rank
Property / zbMATH Keywords
 
nondeterministic finite automata
Property / zbMATH Keywords: nondeterministic finite automata / rank
 
Normal rank
Property / zbMATH Keywords
 
equivalent transformation
Property / zbMATH Keywords: equivalent transformation / rank
 
Normal rank
Property / zbMATH Keywords
 
extended automaton
Property / zbMATH Keywords: extended automaton / rank
 
Normal rank
Property / zbMATH Keywords
 
combining states
Property / zbMATH Keywords: combining states / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an expansion of nondeterministic finite automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:25, 9 July 2024

scientific article
Language Label Description Also known as
English
Some algorithms for equivalent transformation of nondeterministic finite automata
scientific article

    Statements

    Some algorithms for equivalent transformation of nondeterministic finite automata (English)
    0 references
    0 references
    0 references
    21 October 2014
    0 references
    0 references
    nondeterministic finite automata
    0 references
    equivalent transformation
    0 references
    extended automaton
    0 references
    combining states
    0 references