Model completeness of an algebra of languages
HTML articles powered by AMS MathViewer
- by David Haussler PDF
- Proc. Amer. Math. Soc. 83 (1981), 371-374 Request permission
Abstract:
An algebra $\left \langle {\mathcal {L},f,g} \right \rangle$ of languages over a finite alphabet $\Sigma = \{ {a_1}, \ldots ,{a_n}\}$ is defined with operations $f({L_1}, \ldots ,{L_n}) = {a_1}{L_1} \cup \cdots \cup {a_n}{L_n} \cup \{ \lambda \}$ and $g({L_1}, \ldots ,{L_n}) = {a_1}{L_1} \cup \cdots \cup {a_n}{L_n}$ and its first order theory is shown to be model complete. A characterization of the regular languages as unique solutions of sets of equations in $\left \langle {\mathcal {L},f,g} \right \rangle$ is given and it is shown that the subalgebra $\left \langle {\mathcal {R},f,g} \right \rangle$ where $\mathcal {R}$ is the set of regular languages is a prime model for the theory of $\left \langle {\mathcal {L},f,g} \right \rangle$. We show also that the theory of $\left \langle {\mathcal {L},f,g} \right \rangle$ is decidable.References
-
J. H. Conway, Regular algebra and finite machines, Chapman & Hall, London, 1971.
- John E. Hopcroft and Jeffrey D. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley Series in Computer Science, Addison-Wesley Publishing Co., Reading, Mass., 1979. MR 645539
- Jan Mycielski and Paul Perlmutter, Model completeness of some metric completions of absolutely free algebras, Algebra Universalis 12 (1981), no. 2, 137–144. MR 608657, DOI 10.1007/BF02483872
- Michael O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1–35. MR 246760, DOI 10.1090/S0002-9947-1969-0246760-1
Additional Information
- © Copyright 1981 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 83 (1981), 371-374
- MSC: Primary 03C60; Secondary 03B25, 03C35, 03C65, 68D30
- DOI: https://doi.org/10.1090/S0002-9939-1981-0624934-6
- MathSciNet review: 624934