Syntactic structures of regular languages
| Authors | |
|---|---|
| Year of publication | 2019 |
| Type | Article in Periodical |
| Magazine / Source | Theoretical Computer Science |
| MU Faculty or unit | |
| Citation | |
| Web | https://doi.org/10.1016/j.tcs.2019.10.020 |
| Doi | http://dx.doi.org/10.1016/j.tcs.2019.10.020 |
| Keywords | Regular languages; Minimal automaton; Syntactic monoid |
| Description | Given a regular language, its canonical lattice automaton is defined - this is a modification of the notions of the minimal automaton and the canonical meet automaton of the language. Secondly, the concept of the syntactic lattice algebra is introduced as an analogy of the syntactic monoid and of the syntactic semiring. The above three syntactic structures are constructed as certain transformation algebras of the corresponding automata. This leads to a unified approach to the study of syntactic structures of regular languages. The basic properties of the new notions are stated, showing, among others, the minimality of the canonical lattice automaton and the minimality of the syntactic lattice algebra. Using the syntactic lattice algebra, a new characterization of the membership problem for reversible languages is given. |
| Related projects: |