Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition (Q1240575): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5618355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain formal properties of grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\omega\)-computations on deterministic pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\omega\)-computations on Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control sets on grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict deterministic grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems forω-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on asymmetry in phrase structure grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing and generating infinite sequences by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank

Revision as of 21:01, 12 June 2024

scientific article
Language Label Description Also known as
English
Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
scientific article

    Statements

    Identifiers