scientific article; zbMATH DE number 1259068
From MaRDI portal
Publication:4231020
zbMath0935.68056MaRDI QIDQ4231020
Stefano Varricchio, Aldo De Luca
Publication date: 8 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Burnside problemsemi-Thue systemscopying systemscombinatorial aspects of the theory of semigroupsfiniteness and regularity conditionsrecognizable and rational subsets of semigroupsunitary rewriting systems
Combinatorics on words (68R15) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)
Related Items
Directed graphs and combinatorial properties of semigroups, On square-increasing ordered monoids and idempotent semirings, Context-Freeness of Word-MIX Languages, Monomial right ideals and the Hilbert series of noncommutative modules, Well quasi-orders arising from finite ordered semigroups, The origins of combinatorics on words, Primitive sets of words, Unavoidable regularities in long words with bounded number of symbol occurrences, Well quasi-orders generated by a word-shuffle rewriting, Regular languages and partial commutations, Noncommutative algebras, context-free grammars and algebraic Hilbert series, On the Commutative Equivalence of Algebraic Formal Series and Languages, Atoms and partial orders of infinite languages, On new chaotic mappings in symbol space, Finite embeddability property for residuated lattices via regular languages, Unnamed Item, Some Algebraic Properties of Machine Poset of Infinite Words, From Bi-ideals to Periodicity, Well Quasi-orders in Formal Language Theory, Unnamed Item, On bounded linear codes and the commutative equivalence, A coloring problem for infinite words, The monoids of the patience sorting algorithm, On the commutative equivalence of bounded context-free and regular languages: the code case, Well-Quasi Orders and Hierarchy Theory, Determinization of fuzzy automata with membership values in complete residuated lattices, Anti-powers in infinite words, Word problem for knotted residuated lattices., Myhill-Nerode type theory for fuzzy languages and automata, On bounded rational trace languages, A finiteness criterion for inverse semigroups, Well quasi-orders and context-free grammars, On the structure of the counting function of sparse context-free languages., Stefano Varricchio (1960-2008), A generalized palindromization map in free monoids, Unnamed Item, On the separability of sparse context-free languages and of bounded rational relations, Multigraded Hilbert series of noncommutative modules, A congruence-based perspective on automata minimization algorithms, Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics, The Parikh counting functions of sparse context-free languages are quasi-polynomials, A new semigroup obtained via known ones, Synchronized Regular Expressions, DNA combinatorial messages and epigenomics: the case of chromatin organization and nucleosome occupancy in eukaryotic genomes, Well quasi-orders, unavoidable sets, and derivation systems, Obituary: Aldo de Luca 1941--2018, Regular solutions of language inequalities and well quasi-orders
