Skip to main content
SpringerLink
Log in

Concatenation State Machines and Simple Functions

  • Conference paper
Implementation and Application of Automata (CIAA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3317))

Included in the following conference series:

Abstract

We introduce a class of deterministic push-down transducers called concatenation state machines (CSM), and we study its semantic domain which is a class of partial mappings over finitely generated free monoids, called simple functions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Korenjak, A.J., Hopcroft, J.E.: Simple deterministic languages. In: Proc. IEEE 7th Annual Symposium on Switching and Automata Theory. IEEE Symposium on Foundations of Computer Science, pp. 36–46 (1966)

    Google Scholar 

  2. Autebert, J.M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages. Word Language Grammar, vol. 1, pp. 111–174. Springer, Berlin (1997)

    Google Scholar 

  3. Fraczak, W., Podolak, A.: A characterization of s-languages. Information Processing Letters 89, 65–70 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Berstel, J., Perrin, D.: Theory of Codes. Academic Press, London (1985)

    MATH  Google Scholar 

  5. Mohri, M.: Minimization algorithms for sequential transducers. Theoretical Computer Science 234, 177–201 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Caucal, D.: A fast algorithm to decide on simple grammars equivalence. In: Djidjev, H.N. (ed.) Optimal Algorithms. LNCS, vol. 401. Springer, Heidelberg (1989)

    Google Scholar 

  7. Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Prime decompositions of regular prefix codes. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 85–94. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Tarjan, R.: Finding dominators in directed graphs. SIAM Journal on Computing 3, 62–89 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  9. Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, London (1974)

    MATH  Google Scholar 

  10. Berstel, J.: Transductions and Context-Free Languages. Teubner (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IDT Canada, Ottawa, Ontario, Canada

    Wojciech Debski & Wojciech Fraczak

  2. Université du Québec en Outaouais, Gatineau, Québec, Canada

    Wojciech Fraczak

Authors
  1. Wojciech Debski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Fraczak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. Department of Mathematics, University of Turku, Finland

    Alexander Okhotin

  3. School of Computing, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Kai Salomaa

  4. Department of Computer Science, University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Debski, W., Fraczak, W. (2005). Concatenation State Machines and Simple Functions. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30500-2_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24318-2

  • Online ISBN: 978-3-540-30500-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation