First-order logic and star-free sets
Journal of Computer and System Sciences
Polynomial operations on rational languages
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Semigroups and languages of dot-depth two
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Products of languages with counter
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Polynomial operations and hierarchies of concatenation (in French)
Theoretical Computer Science
Finite-automaton aperiodicity is PSPACE-complete
Theoretical Computer Science
Closure of varieties of languages under products with counter
Journal of Computer and System Sciences
Polynomial closure of group languages and open sets of the Hall topology
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Handbook of formal languages, vol. 1
Journal of the ACM (JACM)
Automata, Languages, and Machines
Automata, Languages, and Machines
Varieties Of Formal Languages
Algebraic tools for the concatenation product
Theoretical Computer Science
Languages of Nilpotent and Solvable Groups (Extended Abstract)
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Proprietes syntactiques du produit non ambigu
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Finite Group Topology and p-Adic Topology for Free Monoids
Proceedings of the 12th Colloquium on Automata, Languages and Programming
The Product of Rational Languages
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Polynomial Closure and Unambiguous Product
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Bridges for Concatenation Hierarchies
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Logical Descriptions of Regular Languages
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Sur les variétés de langages et de monoídes
Proceedings of the 4th GI-Conference on Theoretical Computer Science
Some operations and transductions that preserve rationality
Proceedings of the 6th GI-Conference on Theoretical Computer Science
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
FCT '85 Fundamentals of Computation Theory
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Actions, wreath products of C-varieties and concatenation product
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Two algebraic approaches to variants of the concatenation product
Theoretical Computer Science
Theory of Computing Systems
Duality and Equational Theory of Regular Languages
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Equations Defining the Polynomial Closure of a Lattice of Regular Languages
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Elements of Automata Theory
| Hi-index | 0.00 |
The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and profinite topology. This paper surveys research advances on this topic over the last fifty years.