Alternating finite automata and star-free languages (Q1575674): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Derivatives of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equations for regular languages, finite automata, and sequential networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of bounded concurrency I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions for alternating finite automata<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE POWER OF ONE-WAY SYNCHRONIZED ALTERNATING MACHINES WITH SMALL SPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: On communication-bounded synchronized alternating 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: Succinct representation of regular languages by Boolean automata. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Star-Free Events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite monoids having only trivial subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank

Revision as of 13:13, 30 May 2024

scientific article
Language Label Description Also known as
English
Alternating finite automata and star-free languages
scientific article

    Statements