Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View history
Purge
English
Log in
No label defined
(Q3384896)
From MaRDI portal
Jump to:
navigation
,
search
scientific article
Language
Label
Description
Also known as
English
No label defined
scientific article
Statements
instance of
scholarly article
0 references
author
Dana Angluin
0 references
Dana Fisman
0 references
publication date
17 December 2021
0 references
full work available at URL
https://arxiv.org/abs/1809.03108
0 references
http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF18.19
0 references
MaRDI profile type
MaRDI publication profile
0 references
cites work
Learning I/O Automata
0 references
Learning regular sets from queries and counterexamples
0 references
Families of DFAs as Acceptors of omega-Regular Languages
0 references
Q4603446
0 references
Learning Regular Omega Languages
0 references
Learning regular omega languages
0 references
Learning Weighted Automata
0 references
Learning Behaviors of Automata from Multiplicity and Equivalence Queries
0 references
On the Synthesis of Finite-State Machines from Samples of Their Behavior
0 references
Transducers with Origin Information
0 references
Sigma*
0 references
Ultimately periodic words of rational ω-languages
0 references
Q3086925
0 references
Learning Symbolic Automata
0 references
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
0 references
Inferring regular languages and \(\omega\)-languages
0 references
Matrices de Hankel
0 references
TYPENESS FOR ω-REGULAR AUTOMATA
0 references
Learning Meets Verification
0 references
A Generic Algorithm for Learning Symbolic Automata from Membership Queries
0 references
On the learnability of infinitary regular sets
0 references
On syntactic congruences for \(\omega\)-languages
0 references
Learning Regular Languages over Large Ordered Alphabets
0 references
Q5317419
0 references
A Proof of Kamp's theorem
0 references
Saturating right congruences
0 references
Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
0 references
Finite-state \(\omega\)-languages
0 references
Characterizations of rational \(\omega\)-languages by means of right congruences
0 references
Temporal logic can be more expressive
0 references
Identifiers
Mathematics Subject Classification ID
68Q45
0 references
68Q60
0 references
91A80
0 references
zbMATH DE Number
7447748
0 references
Sitelinks
Mathematics
(1 entry)
mardi
Publication:3384896
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
Concept URI
