Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Ajtai, “Σ 11 formulae on finite structures”, Annals of Pure and Applied Logic 24 (1983) 1–48.
D. Mix Barrington, K. Compton, H. Straubing, and D. Thérien, “Regular Languages in NC1” J. Comp. Syst. Sci. 44 (1992) 478–499.
D. Mix Barrington, H. Straubing, and D. Thérien, “Nonuniform Automata over Groups”, Information and Computation 89 (1990) 109–132.
D. Mix Barrington and H. Straubing, “Superlinear Lower Bounds for Boundedwidth Branching Programs”, J. Comp. Syst. Sci. 50 (1995) 374–381.
D. Mix Barrington and D. Thérien, “Finite Monoids and the Fine Structure of NC1”, JACM 35 (1988) 941–952.
J. R. Biichi, “Weak Second-order Arithmetic and Finite Automata”, Zeit. Math. Logik. Grund. Math. 6 (1960) 66–92.
S. Eilenberg, Automata, Languages and Machines, vol. B, Academic Press, New York, 1976.
M. Furst, J. Saxe, and M. Sipser, “Parity, Circuits, and the Polynomial Time Hierarchy”, J. Math Systems Theory 17 (1984) 13–27.
Y. Gurevich and H. Lewis, “A Logic for Constant-Depth Circuits”, Information and Control, 61 (1984) 65–74.
N. Immerman, “Languages That Capture Complexity Classes”, SIAM J. Computing 16 (1987) 760–778.
R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, Cambridge, Massachusetts, 1971.
A. Maciel, P. Péladeau and D. Thérien, “Programs over Semigroups of Dot-depth One”, preprint (1996).
J. E. Pin, Varieties of Formal Languages, Plenum, London, 1986.
A. Razborov, “Lower Bounds for the Size of Circuits of Bounded Depth with Basis λ, ⊕” Math. Notes of the Soviet Academy of Sciences 41 (1987) 333–338.
R. Smolensky, “Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity”, Proc. 19th ACM STOC (1987) 77–82.
H. Straubing, Finite Automata, Formal Languages, and Circuit Complexity, Birkhaiiser, Boston, 1994.
H. Straubing, D. Thérien, and W. Thomas, “Regular Languages Defined with Generalized Quantifiers”,Information and Computation 118 (1995) 289–301.
D. Thérien, “Classification of finite monoids: the language approach”, Theoret. Comput. Sci. 14 (1981) 195–208.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Straubing, H. (1998). Languages defined with modular counting quantifiers. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028572
Download citation
DOI: https://doi.org/10.1007/BFb0028572
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64230-5
Online ISBN: 978-3-540-69705-3
eBook Packages: Springer Book Archive