Learning Deterministic Finite Automata from Interleaved Strings

Jones, Joshua; Oates, Tim

doi:10.1007/978-3-642-15488-1_8

Search citation statements

Order By: Relevance

Paper Sections

Select...

Inference From Execution Traces1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2021

Publication Types

Select...

Article1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Jones and Oates directly address the problem of concurrent tasks producing an interleaved sequence of events and investigate how to disentangle them [44]. They restrict the problem to two instances of the same task (program) running concurrently, or in terms of automata theory: two executing instances of a single DFA whose transitions are traversed until both instances are in a final state.…”

Section: Inference From Execution Tracesmentioning

confidence: 99%

A survey of grammatical inference in software engineering

Stevenson

Cordy

2014

Science of Computer Programming

View full text Add to dashboard Cite

Grammatical inference -used successfully in a variety of fields such as pattern recognition, computational biology and natural language processing -is the process of automatically inferring a grammar by examining the sentences of an unknown language. Software engineering can also benefit from grammatical inference. Unlike these other fields, which use grammars as a convenient tool to model naturally occuring patterns, software engineering treats grammars as first-class objects typically created and maintained for a specific purpose by human designers. We introduce the theory of grammatical inference and review the state of the art as it relates to software engineering.

show abstract

Section: Inference From Execution Tracesmentioning

confidence: 99%