Succinct description of regular languages by weak restarting automata (Q948085): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.ic.2008.03.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023450059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size/lookahead tradeoff for \(LL(k)\)-grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and union of regular languages and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial orders on words, minimal elements of regular languages, and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-complexity of finite-state devices, state compressibility and incompressibility / 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: Restarting automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal NFA Problems are Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of some operations on binary regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of parsers and \(\text{LR}(k)\)-grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in formal languages and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390537 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:06, 28 June 2024

scientific article
Language Label Description Also known as
English
Succinct description of regular languages by weak restarting automata
scientific article

    Statements

    Identifiers