Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
97 | Martin Beaudry, Pierre McKenzie, Denis Thérien |
The Membership Problem in Aperiodic Transformation Monoids. |
J. ACM |
1992 |
DBLP DOI BibTeX RDF |
aperiodic, membership, varieties, monoids |
87 | Volker Diekert, Markus Lohrey, Alexander Miller |
Partially Commutative Inverse Monoids. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
75 | Manfred Droste, Dietrich Kuske |
On Recognizable Languages in Divisibility Monoids. |
FCT |
1999 |
DBLP DOI BibTeX RDF |
|
75 | Maryse Pelletier |
Monoids Described by Pushdown Automata. |
IMYCS |
1990 |
DBLP DOI BibTeX RDF |
|
74 | P. J. Abisha, D. Gnanaraj Thomas, K. G. Subramanian 0001 |
Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups. |
INDOCRYPT |
2003 |
DBLP DOI BibTeX RDF |
Finitely Presented Groups, Free Partially Commutative Monoids, Thue Systems, Public Key Cryptosystem, Word Problem, Zero Knowledge Protocol |
67 | Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener |
Automatic Monoids Versus Monoids with Finite Convergent Presentations. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
63 | Anatolij Dvurecenskij, Jirí Rachunek |
Bounded commutative residuated l-monoids with general comparability and states. |
Soft Comput. |
2006 |
DBLP DOI BibTeX RDF |
AMS classification: 06D35, 03G25, 28E15, 03B50, 06F05 |
63 | Dietrich Kuske |
Divisibility Monoids: Presentation, Word Problem, and Rational Languages. |
FCT |
2001 |
DBLP DOI BibTeX RDF |
|
63 | Daniel Kirsten |
A Connection between the Star Problem and the Finite Power Property in Trace Monoids. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
63 | Andrea Sattler-Klein |
New Undecidablility Results for Finitely Presented Monoids. |
RTA |
1997 |
DBLP DOI BibTeX RDF |
|
63 | Richard Statman |
On Cartesian Monoids. |
CSL |
1996 |
DBLP DOI BibTeX RDF |
|
62 | Gerard Allwein, Hilmi Demir, Lee Pike |
Logics for Classes of Boolean Monoids. |
J. Log. Lang. Inf. |
2004 |
DBLP DOI BibTeX RDF |
algebras of relations, Boolean monoids, correspondence theory, Kripke frames, relative modalities, CMOS circuits |
62 | Françoise Levy-dit-Vehel, Ludovic Perret |
Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups. |
INDOCRYPT |
2004 |
DBLP DOI BibTeX RDF |
Thue Systems, Finitely Presented Groups, Free Partially Commutative Monoids, Homomorphic Mappings, Word Problem, Public Key Cryptanalysis |
62 | Gwénaël Richomme |
Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
trace monoids, Star Problem, Finite Power Property Problem, recognizability |
51 | Andreas Distler, Tom Kelsey |
The Monoids of Order Eight and Nine. |
AISC/MKM/Calculemus |
2008 |
DBLP DOI BibTeX RDF |
|
51 | Christoph Behle, Andreas Krebs, Mark Mercer |
Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Volker Diekert, Paul Gastin |
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids. |
Formal and Natural Computing |
2002 |
DBLP DOI BibTeX RDF |
|
51 | Hajime Machida, Masahiro Miyakawa, Ivo G. Rosenberg |
Some Results on the Centralizers of Monoids in Clone Theory. |
ISMVL |
2002 |
DBLP DOI BibTeX RDF |
Clone, centralizer, monoid |
51 | Daniel Kirsten |
The Star Problem in Trace Monoids: Reductions Beyond C4. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
51 | Ulrich Hertrampf |
Acceptance by Transformation Monoids (with an Application to Local Self Reductions). |
CCC |
1997 |
DBLP DOI BibTeX RDF |
local self reduction, bottleneck machine, structural complexity |
51 | Véronique Bruyère, Clelia de Felice |
Coding and Strong Coding in Trace Monoids. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
|
51 | Edward Ochmanski |
On Morphisms of Trace Monoids. |
STACS |
1988 |
DBLP DOI BibTeX RDF |
|
51 | Barry K. Rosen |
Monoids for Rapid Data Flow Analysis. |
POPL |
1978 |
DBLP DOI BibTeX RDF |
|
50 | Zoltán Fülöp 0001, Andreas Maletti, Heiko Vogler |
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Recognizable tree series, Rational tree series, Multioperator monoids, Semirings |
50 | Ryszard Janicki, Dai Tri Man Le |
Modelling Concurrency with Quotient Monoids. |
Petri Nets |
2008 |
DBLP DOI BibTeX RDF |
quotient monoids, comtraces, stratified partial orders, stratified order structures, traces, canonical representations, step sequences |
47 | Elaine Render, Mark Kambites |
Polycyclic and Bicyclic Valence Automata. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
47 | Jirí Rachunek, Dana Salounová |
A Generalization of Local Fuzzy Structures. |
Soft Comput. |
2007 |
DBLP DOI BibTeX RDF |
Rl-monoid, Local Rl-monoid, Perfect Rl-monoid, Pseudo MV-algebra, Pseudo BL-algebra |
47 | Christian Choffrut, Leucio Guerra |
On the Logical Definability of Some Rational Trace Languages. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
47 | Jean-Eric Pin |
Relational morphisms, transductions and operations on languages. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
47 | Jean Berstel, Jacques Sakarovitch |
Recent Results in the Theory of Rational Sets. |
MFCS |
1986 |
DBLP DOI BibTeX RDF |
|
46 | Hans-Jürgen Hoehnke |
Quasi-varieties: A special access. |
Stud Logica |
2004 |
DBLP DOI BibTeX RDF |
Varieties and quasi-varieties of partial algebras, partial theories, partial Dale monoids, Malcev clones |
46 | Guy McCusker |
A Fully Abstract Relational Model of Syntactic Control of Interference. |
CSL |
2002 |
DBLP DOI BibTeX RDF |
Algol-like languages, interference control, semantics, full abstraction, monoids, object spaces |
46 | Grant Pogosyan, Akihiro Nozaki |
Join-Irreducible Clones of Multiple-Valued Logic Algebra. |
ISMVL |
1995 |
DBLP DOI BibTeX RDF |
join-irreducible clones, multiple valued logic algebra, synthetic means, lattice elements, join irreducible elements, unary functions, constructive criteria, graph theoretical property, one variable function, k valued logic, graph theory, set theory, multivalued logic, group theory, monoids, join operation, generating system |
40 | Martin Beaudry, François Lemieux |
Faithful Loops for Aperiodic E-Ordered Monoids. |
ICALP (2) |
2009 |
DBLP DOI BibTeX RDF |
|
40 | Jirí Rachunek, Filip Svrcek |
Monadic Bounded Commutative Residuated l-monoids. |
Order |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 03G25, 06D20, 06D35, 06F05 |
40 | Michael Hoffmann 0002, Richard M. Thomas |
Notions of Hyperbolicity in Monoids. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Markus Lohrey, Nicole Ondrusch |
Inverse Monoids: Decidability and Complexity of Algebraic Questions. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Hajime Machida, Ivo G. Rosenberg |
Centralizers of Monoids Containing the Symmetric Group. |
ISMVL |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Annika M. Wille |
The Variety of Lattice-Ordered Monoids Generated by the Natural Numbers. |
Stud Logica |
2004 |
DBLP DOI BibTeX RDF |
Lattice-ordered monoid, cancellative monoid, ultraproduct, variety |
40 | Makoto Hamana |
Free S-Monoids: A Higher-Order Syntax with Metavariables. |
APLAS |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Andreas Maletti |
Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids. |
CIAA |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Hajime Machida, Ivo G. Rosenberg |
On the Centralizers of Monoids in Clone Theory. |
ISMVL |
2003 |
DBLP DOI BibTeX RDF |
Clone, centralizer, monoid |
40 | Howard Straubing, Denis Thérien |
Weakly Iterated Block Products of Finite Monoids. |
LATIN |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Ricard Gavaldà, Denis Thérien |
Learning Expressions over Monoids. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
40 | Daniel Kirsten |
Some Undecidability Results Related to the Star Problem in Trace Monoids. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
40 | Friedrich Otto, Masashi Katsura, Yuji Kobayashi |
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. |
RTA |
1997 |
DBLP DOI BibTeX RDF |
|
40 | Harald Ganzinger, Uwe Waldmann |
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract). |
CADE |
1996 |
DBLP DOI BibTeX RDF |
|
38 | Yves Métivier, Gwénaël Richomme |
On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract). |
STACS |
1994 |
DBLP DOI BibTeX RDF |
trace monoids, finite power property, recognizability |
36 | Ricard Gavaldà, Denis Thérien |
An Algebraic Perspective on Boolean Function Learning. |
ALT |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Piotr Hoffman |
Union of Equational Theories: An Algebraic Approach. |
RTA |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Howard Straubing, Denis Thérien |
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Arkadev Chattopadhyay, Denis Thérien |
Locally Commutative Categories. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Dietrich Kuske, Markus Lohrey |
Decidable Theories of Cayley-Graphs. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Volker Diekert, Anca Muscholl |
Solvability of Equations in Free Partially Commutative Groups Is Decidable. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Michal Kunc |
The Trace Coding Problem Is Undecidable. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Tero Harju, Alexandru Mateescu, Arto Salomaa |
Shuffle on Trajectories: The Schützenberger Product and Related Operations. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
36 | Franz Baader, Werner Nutt |
Combination problems for commutative/monoidal theories or how algebra can help in equational unification. |
Appl. Algebra Eng. Commun. Comput. |
1996 |
DBLP DOI BibTeX RDF |
Equational unification, Semiadditive categories, Semirings, Equational theories |
36 | Volker Diekert, Anca Muscholl, Klaus Reinhardt |
On Codings of Traces. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
Topics Formal languages, concurrency |
36 | Véronique Bruyère, Clelia de Felice, Giovanna Guaiana |
Coding with Traces. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
34 | Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin |
Unambiguous Automata. |
Math. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
local automata, synchronized automata, unambiguous automata, unambiguous monoids of relations, Automata |
34 | Shin-ya Katsumata, Susumu Nishimura |
Algebraic fusion of functions with an accumulating parameter and its improvement. |
ICFP |
2006 |
DBLP DOI BibTeX RDF |
accumulating parameter, data contexts, higher-order removal, monoids and monoid homomorphisms, partial and infinite data structures, shortcut fusion |
34 | Sylvia Pulmannová |
Extensions of MV-algebras. |
Soft Comput. |
2003 |
DBLP DOI BibTeX RDF |
Abelian partially ordered groups, Partially ordered partial abelian monoids, Riesz decomposition properties, Short exact sequences, Extensions, MV-algebras, Effect algebras |
34 | Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklos Santha |
Parallel Complexity in the Design and Analysis on Conurrent Systems. |
PARLE (1) |
1991 |
DBLP DOI BibTeX RDF |
partially commutative monoids, PRAM algorithms, Petri nets, CCS, boolean circuits, P-completeness |
32 | Wei Li, Haohao Wang, Yuanhao Liu, Bin Yang 0004 |
The generalizations of fuzzy monoids and vague monoids. |
Soft Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
32 | Gabriella Böhm |
Crossed Modules of Monoids III. Simplicial Monoids of Moore Length 1. |
Appl. Categorical Struct. |
2021 |
DBLP DOI BibTeX RDF |
|
32 | Alan J. Cain, Robert D. Gray, António Malheiro |
Crystal monoids & crystal bases: Rewriting systems and biautomatic structures for plactic monoids of types An, Bn, Cn, Dn, and G2. |
J. Comb. Theory, Ser. A |
2019 |
DBLP DOI BibTeX RDF |
|
32 | Nathan Grosshans |
The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids. (Les limites de la méthode de Nečiporuk et le pouvoir des programmes sur monoïdes issus de petites variétiés de monoïdes finis). |
|
2018 |
RDF |
|
32 | Dietrich Kuske, Olena Prianychnykova |
The trace monoids in the queue monoid and in the direct product of two free monoids. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
32 | Dietrich Kuske, Olena Prianychnykova |
The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids. |
DLT |
2016 |
DBLP DOI BibTeX RDF |
|
32 | Alan J. Cain, António Malheiro |
Deciding conjugacy in sylvester monoids and other homogeneous monoids. |
Int. J. Algebra Comput. |
2015 |
DBLP DOI BibTeX RDF |
|
32 | Matthieu Picantin |
Garside monoids vs divisibility monoids |
CoRR |
2007 |
DBLP BibTeX RDF |
|
32 | Matthieu Picantin |
Garside monoids vs divisibility monoids. |
Math. Struct. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Zhenheng Li, Lex E. Renner |
The Renner Monoids and Cell Decompositions of the Symplectic Algebraic Monoids. |
Int. J. Algebra Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Klaus Madlener, Birgit Reinert |
Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
32 | Phan Trung Huy, Igor Livotsky, Do Long Van |
Which Finite Monoids are Syntactic Monoids of Rational omega-Languages. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
32 | John Rhodes 0001 |
Monoids Acting on Trees: Elliptic and wreath Products and the Holonomy Theorem for Arbitrary Monoids with Applications to Infinite Groups. |
Int. J. Algebra Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
32 | Helmut Jürgensen, Gabriel Thierrin |
Which Monoids are Syntactic Monoids of omega-Languages? |
J. Inf. Process. Cybern. |
1986 |
DBLP BibTeX RDF |
|
32 | Volker Diekert |
Commutative monoids have complete presentations by free (non-commutative) monoids. |
Theor. Comput. Sci. |
1986 |
DBLP DOI BibTeX RDF |
|
28 | Thomas Colcombet |
The Theory of Stabilisation Monoids and Regular Cost Functions. |
ICALP (2) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | G. Zeibig |
Coherence for Product Monoids and their Actions. |
Appl. Categorical Struct. |
2006 |
DBLP DOI BibTeX RDF |
AMS 2000 Mathematics Subject Classification Primary 18D35, Secondary 18D15, 19D23, 18C15 |
28 | Guillem Godoy, Robert Nieuwenhuis |
Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups. |
Constraints An Int. J. |
2004 |
DBLP DOI BibTeX RDF |
symbolic constraints, built-in theories, automated deduction, term orderings |
28 | Markus Lohrey |
Decidability and Complexity in Automatic Monoids. |
Developments in Language Theory |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Hajime Machida, Ivo G. Rosenberg |
Monoids whose Centralizer is the Least Clone. |
ISMVL |
2004 |
DBLP DOI BibTeX RDF |
Clone, centralizer, monoid |
28 | Bas Luttik |
A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas |
Using Transitive-Closure Logic for Deciding Linear Properties of Monoids. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
monoid presentations, transitive closure logic, string rewriting |
28 | Zoltán Ésik |
Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators. |
Developments in Language Theory |
2002 |
DBLP DOI BibTeX RDF |
|
28 | G. Chevalier, Sylvia Pulmannová |
Some Ideal Lattices in Partial Abelian Monoids and Effect Algebras. |
Order |
2000 |
DBLP DOI BibTeX RDF |
dimension equivalence, lattice of ideals, partial Abelian monoid, R 1-ideal, Riesz ideal, Sasaki projection, congruence, ideal, effect algebra |
28 | Masashi Katsura, Yuji Kobayashi, Friedrich Otto |
Undecidability Results for Monoids with Linear-Time Decidable Word Problems. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Jochen Meßner |
Pattern Matching in Trace Monoids (Extended Abstract). |
STACS |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Ilya Beylin, Peter Dybjer |
Extracting a Proof of Coherence for Monoidal Categories from a Proof of Normalization for Monoids. |
TYPES |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Manfred Droste |
A KLeene Theorem for Recognizable Languages over Concurrency Monoids. |
ICALP |
1994 |
DBLP DOI BibTeX RDF |
|
28 | Danièle Beauquier, Andreas Podelski |
Rabin Tree Automata and Finite Monoids. |
MFCS |
1993 |
DBLP DOI BibTeX RDF |
|
28 | Thomas Deiß |
Conditional Seme-Thue Systems for Presenting Monoids. |
STACS |
1992 |
DBLP DOI BibTeX RDF |
|
28 | Alois P. Heinz |
Finding Two-Tree-Factor Elements of Tableau-Defined Monoids in Time O(n³). |
ICCI |
1990 |
DBLP DOI BibTeX RDF |
relational database, query optimization, relational algebra, tableaux |
28 | David A. Mix Barrington, Denis Thérien |
Finite monoids and the fine structure of NC1. |
J. ACM |
1988 |
DBLP DOI BibTeX RDF |
|
28 | Jacques Sakarovitch |
An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages. |
MFCS |
1976 |
DBLP DOI BibTeX RDF |
|
24 | Symeon Bozapalidis, Archontia Grammatikopoulou |
An Eilenberg Theorem for Pictures. |
CAI |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Paolo Baldan, Fabio Gadducci |
Petri Nets Are Dioids. |
AMAST |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Fabio Burderi, Antonio Restivo |
Varieties of Codes and Kraft Inequality. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Lucien Haddad, Hajime Machida, Ivo G. Rosenberg |
Monoidal Intervals of Partial Clones. |
ISMVL |
2007 |
DBLP DOI BibTeX RDF |
|