Skip to main content
SpringerLink
Log in

A Simple Method for Building Bimachines from Functional Finite-State Transducers

  • Conference paper
  • First Online:
Book cover Implementation and Application of Automata (CIAA 2017)

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

Included in the following conference series:

  • 344 Accesses

Abstract

The standard construction of a bimachine from a functional transducer involves a preparation step for converting the transducer into an unambiguous transducer (A transducer is unambiguous if there exists at most one successful path for each label.). The conversion involves a specialized determinization. We introduce a new construction principle where the transducer is directly translated into a bimachine. For any input word accepted by the transducer the bimachine exactly imitates one successful path of the transducer. For some classes of transducers the new construction can build a bimachine with an exponentially lower number of states compared to the standard construction. We first present a simple and generic variant of the construction. A second specialized version leads to better complexity bounds in terms of the size of the bimachine.

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 EPUB and 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

References

  1. Berstel, J.: Transductions and Context-Free Languages. Springer Fachmedien Wiesbaden GmbH, Wiesbaden (1979)

    Google Scholar 

  2. Eilenberg, S.: Automata, Languages and Machines. Academic Press, New York and London (1974)

    MATH  Google Scholar 

  3. Filiot, E., Servais, F.: Visibly pushdown transducers with look-ahead. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 251–263. Springer, Heidelberg (2012). doi:10.1007/978-3-642-27660-6_21

    Chapter  Google Scholar 

  4. Kempe, A.: Part-of-speech tagging with two sequential transducers. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 337–339. Springer, Heidelberg (2001). doi:10.1007/3-540-44674-5_34

    Chapter  Google Scholar 

  5. Mohri, M.: On some applications of finite-state automata theory to natural language processing. J. Nat. Lang. Eng. 2, 1–20 (1996)

    Article  Google Scholar 

  6. Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269–311 (1997)

    MathSciNet  Google Scholar 

  7. Roche, E., Schabes, Y.: Finite-State Language Processing. MIT Press, Cambridge (1997)

    Google Scholar 

  8. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)

    Google Scholar 

  9. Sakarovitch, J., de Souza, R.: Lexicographic decomposition of k-valued transducers. Theor. Comp. Sys. 47(3), 758–785 (2010). http://dx.doi.org/10.1007/s00224-009-9206-6

  10. Santean, N.: Bimachines and structurally-reversed automata. J. Automata Lang. Comb. 9(1), 121–146 (2004)

    MathSciNet  MATH  Google Scholar 

  11. Schützenberger, M.P.: A remark on finite transducers. Inf. Control 4, 185–196 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  12. Souza, R.: A note on bimachines. In: 1a Escola de Informática Teórica e Métodos Formais, Natal - RN, pp. 83–92, November 2016

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Informatics, Sofia University, 5, James Borchier Blvd., 1164, Sofia, Bulgaria

    Stefan Gerdjikov

  2. Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, 25A, Acad. G. Bonchev Street, 1113, Sofia, Bulgaria

    Stefan Gerdjikov & Stoyan Mihov

  3. Centrum für Informations-und Sprachverarbeitung (CIS), Ludwig-Maximilians-Universität München, Oettingenstr. 67, 80538, München, Germany

    Klaus U. Schulz

Authors
  1. Stefan Gerdjikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stoyan Mihov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Klaus U. Schulz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stoyan Mihov .

Editor information

Editors and Affiliations

  1. LIGM (UMR 8049), CNRS, Université Paris-Est, Marne-la-Vallée Cedex 2, France

    Arnaud Carayol

  2. LIGM (UMR 8049), Université Paris-Est, Marne-la-Vallée Cedex 2, France

    Cyril Nicaud

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gerdjikov, S., Mihov, S., Schulz, K.U. (2017). A Simple Method for Building Bimachines from Functional Finite-State Transducers. In: Carayol, A., Nicaud, C. (eds) Implementation and Application of Automata. CIAA 2017. Lecture Notes in Computer Science(), vol 10329. Springer, Cham. https://doi.org/10.1007/978-3-319-60134-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60134-2_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60133-5

  • Online ISBN: 978-3-319-60134-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation