Inferring regular languages and \(\omega\)-languages (Q1648037): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jlamp.2018.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2808742141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning I/O Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of interface specifications for Java classes / 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: Queries and concept learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query Learning of Derived Omega-Tree Languages in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of DFAs as Acceptors of omega-Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Regular Omega Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular omega languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A syntactic congruence for rational \(\omega\)-languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Weighted Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Behaviors of Automata from Multiplicity and Equivalence Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Synthesis of Finite-State Machines from Samples of Their Behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transducers with Origin Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sigma* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultimately periodic words of rational ω-languages / 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 the Language of Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of \(\omega\)-languages from prefixes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Symbolic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices de Hankel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of automaton identification from given data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring Network Invariants Automatically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact DFA Identification Using SAT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring Canonical Register Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On?-Languages whose syntactic monoid is trivial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of regular languages by Boolean automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Meets Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the learnability of infinitary regular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On syntactic congruences for \(\omega\)-languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing and generating infinite sequences by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Automaton Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the inference of minimum size DFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4807832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of finite automata using homing sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-state \(\omega\)-languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5723183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093366 / rank
 
Normal rank

Latest revision as of 01:36, 16 July 2024

scientific article
Language Label Description Also known as
English
Inferring regular languages and \(\omega\)-languages
scientific article

    Statements

    Inferring regular languages and \(\omega\)-languages (English)
    0 references
    0 references
    27 June 2018
    0 references
    grammatical inference
    0 references
    model learning
    0 references
    regular languages
    0 references
    \(\omega\)-regular languages
    0 references
    right congruence
    0 references
    Myhill-Nerode theorem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers