Skip to main content
Springer Nature Link
Log in

Learning Deterministic Finite Automata from Interleaved Strings

  • Conference paper
Grammatical Inference: Theoretical Results and Applications (ICGI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6339))

Included in the following conference series:

  • 882 Accesses

Abstract

Workflows are an important knowledge representation used to understand and automate processes in diverse task domains. Past work has explored the problem of learning workflows from traces of processing. In this paper, we are concerned with learning workflows from interleaved traces captured during the concurrent processing of multiple task instances. We first present an abstraction of the problem of recovering workflows from interleaved example traces in terms of grammar induction. We then describe a two-stage approach to reasoning about the problem, highlighting some negative results that demonstrate the need to work with a restricted class of languages. Finally, we give an example of a restricted language class called terminated languages for which an accepting deterministic finite automaton (DFA) can be recovered in the limit from interleaved strings, and make remarks about the applicability of the two-stage approach to terminated languages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741–765 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  2. García, P., Vidal, E.: Inference of k-testable languages in the strict sense and application to syntactic pattern recognition. IEEE Trans. Pattern Anal. Mach. Intell. 12(9), 920–925 (1990)

    Article  Google Scholar 

  3. Gil, Y., Deelman, E., Ellisman, M., Fahringer, T., Fox, G., Gannon, D., Goble, C., Livny, M., Moreau, L., Myers, J.: Examining the challenges of scientific workflows. Computer 40, 24–32 (2007)

    Article  Google Scholar 

  4. Gischer, J.: Shuffle languages, petri nets, and context-sensitive grammars. Commun. ACM 24(9), 597–605 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gold, E.M.: Language identification in the limit. Information and Control 10(5), 447–474 (1967), http://www.isrl.uiuc.edu/~amag/langev/paper/gold67limit.html

    Article  MATH  Google Scholar 

  6. Jedrzejowicz, J.: Structural properties of shuffle automata. Grammars 2(1), 35–51 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Mayer, A.J., Stockmeyer, L.J.: The complexity of word problems—this time with interleaving. Inf. Comput. 115(2), 293–311 (1994)

    Article  MathSciNet  Google Scholar 

  8. Reijers, H.A.: Design and Control of Workflow Processes. Springer, New York (2003)

    Book  MATH  Google Scholar 

  9. Yaman, F., Oates, T., Burstein, M.H.: A context driven approach for workflow mining. In: Boutilier, C. (ed.) IJCAI, pp. 1798–1803 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Maryland, Baltimore County, 1000 Hilltop Circle, Baltimore, Maryland, USA

    Joshua Jones & Tim Oates

Authors
  1. Joshua Jones
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tim Oates
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Sistemas Informáticos y Computatión, Universidad Politécnica de Valencia, Camino de Vera s/n, 46022, Valencia, Spain

    José M. Sempere  & Pedro García  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jones, J., Oates, T. (2010). Learning Deterministic Finite Automata from Interleaved Strings. In: Sempere, J.M., García, P. (eds) Grammatical Inference: Theoretical Results and Applications. ICGI 2010. Lecture Notes in Computer Science(), vol 6339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15488-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15488-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15487-4

  • Online ISBN: 978-3-642-15488-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics