Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Finite Automata for Variable Assignment Languages and Their Algorithmic Inference
Download
AtakanGaripler_FAVAs_and_Their_Inference.pdf.pdf
Date
2023-9-07
Author
Garipler, Atakan
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
59
views
11
downloads
Cite This
Finite automata for variable assignment languages (FA-VA), a subclass of determinis tic finite automata, are defined. Properties of FA-VAs are analyzed. An active learning algorithm that infers FA-VA-based models of interactive constraint-based systems is devised. Advantages and limitations of the proposed representation method and the algorithm are discussed.
Subject Keywords
Model Learning
,
Automata Theory
,
Active Automata Learning
,
Constraint Acquisition
,
Representation of Constraint-based Systems
URI
https://hdl.handle.net/11511/105452
Collections
Graduate School of Natural and Applied Sciences, Thesis
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Garipler, “Finite Automata for Variable Assignment Languages and Their Algorithmic Inference,” M.S. - Master of Science, Middle East Technical University, 2023.
