Abstract
A biautomaton is a finite automaton which arbitrarily alternates between reading the input word from the left and from the right. Some compatibility assumptions in the formal definition of a biautomaton ensure that the acceptance of an input does not depend on the way how the input is read. The paper studies the constructions of biautomata from the descriptional point of view. It proves that the tight bounds on the size of a biautomaton recognizing a regular language represented by a deterministic or nondeterministic automaton of n states, or by a syntactic monoid of size n, are n·2n − 2(n − 1), 22n − 2(2n − 1), and n 2, respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brzozowski, J.: Derivatives of regular expressions. J. ACM 11, 481–494 (1964)
Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149–158 (1986); Erratum: Theoret. Comput. Sci. 302, 497–498 (2003)
Hall Jr., M.: Theory of Groups. Macmillan (1959)
Jirásková, G., Šebej, J.: Note on reversal of binary regular languages. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) DCFS 2011. LNCS, vol. 6808, pp. 212–221. Springer, Heidelberg (2011)
Klíma, O., Polák, L.: On biautomata. To appear in RAIRO, http://math.muni.cz/~klima/Math/publications.html (previous version: Non-Classical Models for Automata and Applications, NCMA 2011, pp. 153–164)
Klíma, O., Polák, L.: Biautomata for k-Piecewise Testable Languages. Accepted at DLT (2012), preprint available at, http://math.muni.cz/~klima/Math/publications.html
Loukanova, R.: Linear Context Free Languages. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 351–365. Springer, Heidelberg (2007)
Lyubich, Y.I.: Estimates for optimal determinization of nondeterministic autonomous automata. Sib. Mat. Zh. 5, 337–355 (1964)
Pin, J.-E.: Chapter 10: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 679–746. Springer, Heidelberg (1997)
Schützenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control 8, 190–194 (1965)
Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (1997)
Šebej, J.: Reversal of regular languages and state complexity. In: Pardubská, D. (ed.) Proc. 10th ITAT, Šafárik University, Košice, pp. 47–54 (2010)
Simon, I.: Piecewise Testable Events. In: GI-Fachtagung 1975. LNCS, vol. 33, pp. 214–222. Springer, Heidelberg (1975)
Yu, S.: Chapter 2: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 41–110. Springer, Heidelberg (1997)
Yu, S., Zhuang, Q., Salomaa, K.: The state complexity of some basic operations on regular languages. Theoret. Comput. Sci. 125, 315–328 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jirásková, G., Klíma, O. (2012). Descriptional Complexity of Biautomata. In: Kutrib, M., Moreira, N., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2012. Lecture Notes in Computer Science, vol 7386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31623-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-31623-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31622-7
Online ISBN: 978-3-642-31623-4
eBook Packages: Computer ScienceComputer Science (R0)