Learning deterministic variable automata over infinite alphabets

DOI10.1007/978-3-030-30942-8_37zbMATH Open1539.68122MaRDI QIDQ6535973FDOQ6535973

Authors: Sarai Sheinvald 

Publication date: 14 March 2024

Recommendations

• Variable automata over infinite alphabets
• Learning deterministic automata on infinite words
• Learning nominal automata
• The learnability of symbolic automata
• Learning symbolic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cites Work

• Learning regular sets from queries and counterexamples
• Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
• Two-variable logic on data trees and XML reasoning
• Finite-memory automata
• Variable automata over infinite alphabets
• Title not available (Why is that?)
• Finite-state unification automata and relational languages
• Learning symbolic automata
• The learnability of symbolic automata
• A robust class of data languages and an application to learning

This page was built for publication: Learning deterministic variable automata over infinite alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535973)