Characterizing classes of regular languages using prefix codes of bounded synchronization delay
From MaRDI portal
Publication:4588867
DOI10.1142/S021819671750028XzbMath1373.68291arXiv1602.08981OpenAlexW2962688057MaRDI QIDQ4588867
Publication date: 3 November 2017
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.08981
Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (1)
Cites Work
- Discrete algebraic methods. Arithmetic, cryptography, automata and groups
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Star-free languages are Church-Rosser congruential
- Almost finite expansions of arbitrary semigroups
- A survey on the local divisor technique
- On the irreducibility of pseudovarieties of semigroups.
- The Schützenberger category of a semigroup.
- A syntactic congruence for rational \(\omega\)-languages
- Group theory via global semigroup theory
- Regular languages defined with generalized quantifiers
- Omega-rational expressions with bounded synchronization delay
- Global structure theories for finite semigroups. Introduction. I: Extension of the fundamental theorem of finite semigroups. II: Axioms for complexity for all finite semigroups. III: Complexity of two-\(J\) class semigroups. IV: Synthesis of the classical and modern theory of finite semigroups
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- On finite monoids having only trivial subgroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Characterizing classes of regular languages using prefix codes of bounded synchronization delay
