An algebraic approach to data languages and timed languages (Q1398367): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Langages sur des alphabets infinis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical characterization of data languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4807830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4514735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of clocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-memory automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite monoids having only trivial subgroups / rank
 
Normal rank

Latest revision as of 17:33, 5 June 2024

scientific article
Language Label Description Also known as
English
An algebraic approach to data languages and timed languages
scientific article

    Statements

    An algebraic approach to data languages and timed languages (English)
    0 references
    0 references
    0 references
    0 references
    29 July 2003
    0 references
    regular languages
    0 references
    finite automata
    0 references

    Identifiers