ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON (Q5714672): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jean-Marc Champarnaud / rank
Normal rank
 
Property / author
 
Property / author: Fabien Coulon / rank
Normal rank
 
Property / author
 
Property / author: Jean-Marc Champarnaud / rank
 
Normal rank
Property / author
 
Property / author: Fabien Coulon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometrical view of the determinization and minimization of finite-state automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal NFA Problems are Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the State Minimization of Nondeterministic Finite Automata / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054105003790 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047110092 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:51, 30 July 2024

scientific article; zbMATH DE number 2239046
Language Label Description Also known as
English
ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON
scientific article; zbMATH DE number 2239046

    Statements

    Identifiers