Inferring regular languages and \(\omega\)-languages
type: Item
instance of: scholarly article
title: Inferring regular languages and \(\omega\)-languages
zbMATH Open document ID: 1394.68211
author: Dana Fisman
published in: Journal of Logical and Algebraic Methods in Programming
publication date: 2018-06-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 6895013
zbMATH Keywords: grammatical inference
zbMATH Keywords: model learning
zbMATH Keywords: regular languages
zbMATH Keywords: \(\omega\)-regular languages
zbMATH Keywords: right congruence
zbMATH Keywords: Myhill-Nerode theorem
describes a project that uses: libalf
describes a project that uses: CALF
describes a project that uses: LEVER
describes a project that uses: LearnLib
describes a project that uses: Sigma*
MaRDI profile type: Publication
full work available at URL: j.jlamp.2018.03.002
OpenAlex ID: W2808742141
cites work: Learning I/O Automata
cites work: Synthesis of interface specifications for Java classes
cites work: Learning regular sets from queries and counterexamples
cites work: Queries and concept learning
cites work: Query Learning of Derived Omega-Tree Languages in Polynomial Time
cites work: Families of DFAs as Acceptors of omega-Regular Languages
cites work: Learning Regular Omega Languages
cites work: Learning regular omega languages
cites work: A syntactic congruence for rational \(\omega\)-languages
cites work: Learning Weighted Automata
cites work: Learning Behaviors of Automata from Multiplicity and Equivalence Queries
cites work: On the Synthesis of Finite-State Machines from Samples of Their Behavior
cites work: Transducers with Origin Information
cites work: Sigma*
cites work: Ultimately periodic words of rational ω-languages
cites work: Active learning for extended finite state machines
cites work: Learning the Language of Error
cites work: Q5317419
cites work: Inference of \(\omega\)-languages from prefixes.
cites work: Q2762501
cites work: Learning Symbolic Automata
cites work: Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
cites work: Matrices de Hankel
cites work: Language identification in the limit
cites work: Complexity of automaton identification from given data
cites work: Inferring Network Invariants Automatically
cites work: Exact DFA Identification Using SAT Solvers
cites work: Inferring Canonical Register Automata
cites work: On?-Languages whose syntactic monoid is trivial
cites work: Succinct representation of regular languages by Boolean automata
cites work: Learning Meets Verification
cites work: Q4770336
cites work: Q4536446
cites work: On the learnability of infinitary regular sets
cites work: On syntactic congruences for \(\omega\)-languages
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Linear Automaton Transformations
cites work: Efficient algorithms for the inference of minimum size DFAs
cites work: Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
cites work: Q4807832
cites work: Inference of finite automata using homing sequences
cites work: Finite-state \(\omega\)-languages
cites work: Q5723183
cites work: Q5111197
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Q4093366
DOI: 10.1016/J.JLAMP.2018.03.002
description: scientific article; zbMATH DE number 6895013