Structural Presburger digit vector automata (Q2378536): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient Symbolic Representations for Arithmetic Constraints in Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine equations, Presburger arithmetic and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and \(p\)-recognizable sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the automata size for Presburger arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definable criterion for definability in Presburger arithmetic and its applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of System Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518891 / rank
 
Normal rank

Revision as of 22:28, 28 June 2024

scientific article
Language Label Description Also known as
English
Structural Presburger digit vector automata
scientific article

    Statements

    Identifiers