Fast computations on ordered nominal sets (Q5918532): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LOIS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FreshOCaml / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NLambda / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: z3 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4288567395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computations on ordered nominal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-memory automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory in nominal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of symbolic automata and transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: History-Register Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and Logics for Words and Trees over an Infinite Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Register Automata with Fresh Value Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fresh Approach to Learning Register Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active learning for extended finite state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Symbolic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning nominal automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to abstract syntax with variable binding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5013828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOIS: syntax and semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: WQO dichotomy for 3-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of Symmetries as Efficient Models of Resource Binding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Characterization of Timed Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Purely Functional Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards nominal computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetries, local names and dynamic (de)-allocation of names / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimilarity in Fresh-Register Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generic Algorithm for Learning Symbolic Automata from Membership Queries / rank
 
Normal rank

Latest revision as of 10:12, 30 July 2024

scientific article; zbMATH DE number 7601540
Language Label Description Also known as
English
Fast computations on ordered nominal sets
scientific article; zbMATH DE number 7601540

    Statements

    Fast computations on ordered nominal sets (English)
    0 references
    0 references
    0 references
    0 references
    14 October 2022
    0 references
    nominal sets
    0 references
    automata theory
    0 references
    minimisation
    0 references
    automata learning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers