Logical definability of some rational trace languages (Q4850330): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of the decidability of some problems for regular trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3763601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Problems of Finite Automata Design and Related Arithmetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equidivisible semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical approach of Petri net languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order logic and star-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regular trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying regular events in symbolic logic / rank
 
Normal rank

Latest revision as of 17:37, 23 May 2024

scientific article; zbMATH DE number 803772
Language Label Description Also known as
English
Logical definability of some rational trace languages
scientific article; zbMATH DE number 803772

    Statements