DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY (Q5704377): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Hing-Man Leung / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q57380747 / rank
 
Normal rank
Property / author
 
Property / author: Hing-Man Leung / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-entry finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound technique for the size of nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity method for measuring nondeterminism in finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of regular languages by Boolean automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on multiple-entry finite automata / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054105003418 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093294649 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:28, 30 July 2024

scientific article; zbMATH DE number 2228600
Language Label Description Also known as
English
DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
scientific article; zbMATH DE number 2228600

    Statements

    Identifiers