Abstract
Regular languages are central objects of study in computer science. Although they are quite “easy” in the traditional space-time framework of sequential computations, the situation is different when other models are considered.In this paper we consider the subclass of regular languages that can be defined via unambiguous concatenation. We show remarkable algorithmic properties of this class in the context of boolean circuits and in that of computational learning.
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
Ambainis, A., Beaudry, M., Golovkins, M., Kikusts, A., Mercer, M., Thérien, D.: Algebraic results on quantum automata. In: STACS, pp. 93–104 (2004)
Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1. In: STOC, pp. 1–5 (1986)
Barrington, D., Thérien, D.: Finite monoids and the fine structure of NC 1. J. ACM 35(4), 941–952 (1988)
Bilardi, G., Preparata, F.: Characterization of associative operations with prefix circuits of constant depth and linear size. SIAM J.Computing 19(2), 246–255 (1990)
Bshouty, N., Cleve, R., Gavaldà, R., Kannan, S., Tamon, C.: Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences 52, 421–433 (1996)
Buhrman, H.: Private communication (2004)
Chandra, A.K., Fortune, S., Lipton, R.: Unbounded fan-in circuits and associative functions. JCSS 30, 222–234 (1985)
Chen, Z., Homer, S.: On learning counting functions with queries. In: COLT, pp. 218–227. ACM Press, New York (1994)
Eilenberg, S.: Automata, Languages and Machines, vol. B. Academic Press, New York (1976)
Gavaldà, R., Thérien, D.: Learning expressions over monoids. In: STACS, pp. 283–293 (2001)
Gavaldà, R., Thérien, D.: Algebraic characterizations of small classes of boolean functions. In: STACS, pp. 331–342 (2003)
Koucký, M., Pudlák, P., Thérien, D.: Star-free languages needing linear number of wires (In preparation)
Moore, C., Tesson, P., Thérien, D.: Satisfiability of systems of equations over finite monoids. In: MFCS, pp. 537–547 (2001)
Pin, J., Weil, P.: Polynomial closure and unambiguous product. In: Fülöp, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 348–359. Springer, Heidelberg (1995)
Pin, J.E.: Varieties of Formal Languages. Plenum, London (1986)
Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3, 114–125 (1959)
Schützenberger, M.: On finite monoids having only trivial subgroups. Inform. and Control 8, 190–194 (1965)
Schützenberger, M.: Sur le produit de concatenation non ambigu. Semigroup Forum 13, 47–75 (1976)
Schwentick, T., Thérien, D., Vollmer, H.: Partially-ordered two-way automata: A new characterization of DA. Developments in Language Theory, 239–250 (2001)
Simon, H.U.: Learning decision lists and trees with equivalence-queries. In: EuroCOLT, pp. 322–336 (1995)
Sipser, M.: Borel sets and circuit complexity. In: STOC, pp. 61–69 (1983)
Straubing, H.: Finite Automata, Formal Logic and Circuit Complexity. Birkhäuser, Basel (1994)
Tesson, P., Thérien, D.: Diamonds are forever: the variety DA. In: Gomez, G., Silva, P., Pin, J.E. (eds.) Semigroups, Algorithms, Automata and Languages, WSP (2002)
Tesson, P., Thérien, D.: Complete classifications of the communication complexity of regular languages. In: STACS, pp. 62–73 (2003)
Thérien, D., Wilke, T.: Over words, two variables are as powerful as one quantifier alternation. In: STOC, pp. 234–240 (1998)
Thérien, D., Wilke, T.: Nesting until and since in linear temporal logic. Theory of Computing Systems 37(1), 111–131 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thérien, D. (2004). Regular Languages, Unambiguous Concatenation and Computational Complexity. In: Lodaya, K., Mahajan, M. (eds) FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2004. Lecture Notes in Computer Science, vol 3328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30538-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-30538-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24058-7
Online ISBN: 978-3-540-30538-5
eBook Packages: Computer ScienceComputer Science (R0)