Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
97 | Martin Beaudry, Pierre McKenzie, Denis Thérien |
The Membership Problem in Aperiodic Transformation Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 39(3), pp. 599-616, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
aperiodic, membership, varieties, monoids |
87 | Volker Diekert, Markus Lohrey, Alexander Miller |
Partially Commutative Inverse Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 292-304, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
75 | Manfred Droste, Dietrich Kuske |
On Recognizable Languages in Divisibility Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings, pp. 246-257, 1999, Springer, 3-540-66412-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
75 | Maryse Pelletier |
Monoids Described by Pushdown Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMYCS ![In: Aspects and Prospects of Theoretical Computer Science, 6th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 19-23, 1990, Proceedings, pp. 195-203, 1990, Springer, 3-540-53414-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INDOCRYPT ![In: Progress in Cryptology - INDOCRYPT 2003, 4th International Conference on Cryptology in India, New Delhi, India, December 8-10, 2003, Proceedings, pp. 218-227, 2003, Springer, 3-540-20609-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings, pp. 32-46, 1998, Springer, 3-540-64301-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
63 | Anatolij Dvurecenskij, Jirí Rachunek |
Bounded commutative residuated l-monoids with general comparability and states. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 10(3), pp. 212-218, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
AMS classification: 06D35, 03G25, 28E15, 03B50, 06F05 |
63 | Dietrich Kuske |
Divisibility Monoids: Presentation, Word Problem, and Rational Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 227-239, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
63 | Daniel Kirsten |
A Connection between the Star Problem and the Finite Power Property in Trace Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 473-482, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
63 | Andrea Sattler-Klein |
New Undecidablility Results for Finitely Presented Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings, pp. 68-82, 1997, Springer, 3-540-62950-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
63 | Richard Statman |
On Cartesian Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers, pp. 446-459, 1996, Springer, 3-540-63172-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
62 | Gerard Allwein, Hilmi Demir, Lee Pike |
Logics for Classes of Boolean Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 13(3), pp. 241-266, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INDOCRYPT ![In: Progress in Cryptology - INDOCRYPT 2004, 5th International Conference on Cryptology in India, Chennai, India, December 20-22, 2004, Proceedings, pp. 275-289, 2004, Springer, 3-540-24130-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings, pp. 577-586, 1994, Springer, 3-540-58338-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISC/MKM/Calculemus ![In: Intelligent Computer Mathematics, 9th International Conference, AISC 2008, 15th Symposium, Calculemus 2008, 7th International Conference, MKM 2008, Birmingham, UK, July 28 - August 1, 2008. Proceedings, pp. 61-76, 2008, Springer, 978-3-540-85109-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
51 | Christoph Behle, Andreas Krebs, Mark Mercer |
Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 147-158, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal and Natural Computing ![In: Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002], pp. 26-38, 2002, Springer, 3-540-43190-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
51 | Hajime Machida, Masahiro Miyakawa, Ivo G. Rosenberg |
Some Results on the Centralizers of Monoids in Clone Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 32nd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2002), May 15-18, 2002, Boston, Massachusetts, USA, pp. 10-16, 2002, IEEE Computer Society, 0-7695-1462-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Clone, centralizer, monoid |
51 | Daniel Kirsten |
The Star Problem in Trace Monoids: Reductions Beyond C4. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 591-602, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
51 | Ulrich Hertrampf |
Acceptance by Transformation Monoids (with an Application to Local Self Reductions). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 213-224, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 373-384, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
51 | Edward Ochmanski |
On Morphisms of Trace Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 88, 5th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 11-13, 1988, Proceedings, pp. 346-355, 1988, Springer, 3-540-18834-7. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
51 | Barry K. Rosen |
Monoids for Rapid Data Flow Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, Arizona, USA, January 1978, pp. 47-59, 1978, ACM Press. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 44(3), pp. 455-499, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Applications and Theory of Petri Nets, 29th International Conference, PETRI NETS 2008, Xi'an, China, June 23-27, 2008. Proceedings, pp. 251-269, 2008, Springer, 978-3-540-68745-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, pp. 464-475, 2008, Springer, 978-3-540-88281-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
47 | Jirí Rachunek, Dana Salounová |
A Generalization of Local Fuzzy Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 11(6), pp. 565-571, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 494-504, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
47 | Jean-Eric Pin |
Relational morphisms, transductions and operations on languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Properties of Finite Automata and Applications ![In: Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings, pp. 34-55, 1988, Springer, 3-540-51631-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
47 | Jean Berstel, Jacques Sakarovitch |
Recent Results in the Theory of Rational Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings, pp. 15-28, 1986, Springer, 3-540-16783-8. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
46 | Hans-Jürgen Hoehnke |
Quasi-varieties: A special access. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 78(1-2), pp. 249-260, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings, pp. 247-261, 2002, Springer, 3-540-44240-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 25th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1995, Bloomington, Indiana, USA, May 23-25, 1995, Proceedings, pp. 194-199, 1995, IEEE Computer Society, 0-8186-7118-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, pp. 55-66, 2009, Springer, 978-3-642-02929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
40 | Jirí Rachunek, Filip Svrcek |
Monadic Bounded Commutative Residuated l-monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 25(2), pp. 157-175, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings, pp. 341-352, 2007, Springer, 978-3-540-74239-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Markus Lohrey, Nicole Ondrusch |
Inverse Monoids: Decidability and Complexity of Algebraic Questions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 664-675, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Hajime Machida, Ivo G. Rosenberg |
Centralizers of Monoids Containing the Symmetric Group. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 35th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2005), 18-21 May 2005, Calgary, Canada, pp. 227-233, 2005, IEEE Computer Society, 0-7695-2336-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Annika M. Wille |
The Variety of Lattice-Ordered Monoids Generated by the Natural Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 76(2), pp. 275-290, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Lattice-ordered monoid, cancellative monoid, ultraproduct, variety |
40 | Makoto Hamana |
Free S-Monoids: A Higher-Order Syntax with Metavariables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems: Second Asian Symposium, APLAS 2004, Taipei, Taiwan, November 4-6, 2004. Proceedings, pp. 348-363, 2004, Springer, 3-540-23724-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Andreas Maletti |
Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers, pp. 323-324, 2004, Springer, 3-540-24318-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Hajime Machida, Ivo G. Rosenberg |
On the Centralizers of Monoids in Clone Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 16-19 May 2003, Tokyo, Japan, pp. 303-308, 2003, IEEE Computer Society, 0-7695-1918-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Clone, centralizer, monoid |
40 | Howard Straubing, Denis Thérien |
Weakly Iterated Block Products of Finite Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings, pp. 91-104, 2002, Springer, 3-540-43400-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Ricard Gavaldà, Denis Thérien |
Learning Expressions over Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 283-293, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
40 | Daniel Kirsten |
Some Undecidability Results Related to the Star Problem in Trace Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings, pp. 227-236, 1999, Springer. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
40 | Friedrich Otto, Masashi Katsura, Yuji Kobayashi |
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings, pp. 53-67, 1997, Springer, 3-540-62950-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
40 | Harald Ganzinger, Uwe Waldmann |
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30 - August 3, 1996, Proceedings, pp. 388-402, 1996, Springer, 3-540-61511-3. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, pp. 341-352, 1994, Springer, 3-540-57785-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
trace monoids, finite power property, recognizability |
36 | Ricard Gavaldà, Denis Thérien |
An Algebraic Perspective on Boolean Function Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 20th International Conference, ALT 2009, Porto, Portugal, October 3-5, 2009. Proceedings, pp. 201-215, 2009, Springer, 978-3-642-04413-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Piotr Hoffman |
Union of Equational Theories: An Algebraic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 61-73, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(1), pp. 29-69, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Arkadev Chattopadhyay, Denis Thérien |
Locally Commutative Categories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 984-995, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Dietrich Kuske, Markus Lohrey |
Decidable Theories of Cayley-Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 463-474, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Volker Diekert, Anca Muscholl |
Solvability of Equations in Free Partially Commutative Groups Is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 543-554, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Michal Kunc |
The Trace Coding Problem Is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 603-614, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Tero Harju, Alexandru Mateescu, Arto Salomaa |
Shuffle on Trajectories: The Schützenberger Product and Related Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 503-511, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
36 | Franz Baader, Werner Nutt |
Combination problems for commutative/monoidal theories or how algebra can help in equational unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 7(4), pp. 309-337, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Equational unification, Semiadditive categories, Semirings, Equational theories |
36 | Volker Diekert, Anca Muscholl, Klaus Reinhardt |
On Codings of Traces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 385-396, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Topics Formal languages, concurrency |
36 | Véronique Bruyère, Clelia de Felice, Giovanna Guaiana |
Coding with Traces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, pp. 353-364, 1994, Springer, 3-540-57785-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
34 | Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin |
Unambiguous Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(4), pp. 625-638, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, ICFP 2006, Portland, Oregon, USA, September 16-21, 2006, pp. 227-238, 2006, ACM, 1-59593-309-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 7(7), pp. 476-481, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARLE (1) ![In: PARLE '91: Parallel Architectures and Languages Europe, Volume I: Parallel Architectures and Algorithms, Eindhoven, The Netherlands, June 10-13, 1991, Proceedings, pp. 288-303, 1991, Springer, 3-540-54151-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 27(12), pp. 7699-7714, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
32 | Gabriella Böhm |
Crossed Modules of Monoids III. Simplicial Monoids of Moore Length 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 29(1), pp. 1-29, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 162, pp. 406-466, 2019. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2018 |
RDF |
|
32 | Dietrich Kuske, Olena Prianychnykova |
The trace monoids in the queue monoid and in the direct product of two free monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1603.07217, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DLT ![In: Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings, pp. 256-267, 2016, Springer, 978-3-662-53131-0. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
32 | Alan J. Cain, António Malheiro |
Deciding conjugacy in sylvester monoids and other homogeneous monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Algebra Comput. ![In: Int. J. Algebra Comput. 25(5), pp. 899-915, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
32 | Matthieu Picantin |
Garside monoids vs divisibility monoids ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0707.0785, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
32 | Matthieu Picantin |
Garside monoids vs divisibility monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 15(2), pp. 231-242, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Zhenheng Li, Lex E. Renner |
The Renner Monoids and Cell Decompositions of the Symplectic Algebraic Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Algebra Comput. ![In: Int. J. Algebra Comput. 13(2), pp. 111-132, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 208(1-2), pp. 3-31, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
32 | Phan Trung Huy, Igor Livotsky, Do Long Van |
Which Finite Monoids are Syntactic Monoids of Rational omega-Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 42(3), pp. 127-132, 1992. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Algebra Comput. ![In: Int. J. Algebra Comput. 1(2), pp. 253-280, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
32 | Helmut Jürgensen, Gabriel Thierrin |
Which Monoids are Syntactic Monoids of omega-Languages? ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Process. Cybern. ![In: J. Inf. Process. Cybern. 22(10/11), pp. 513-526, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP BibTeX RDF |
|
32 | Volker Diekert |
Commutative monoids have complete presentations by free (non-commutative) monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 46, pp. 319-327, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
28 | Thomas Colcombet |
The Theory of Stabilisation Monoids and Regular Cost Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, pp. 139-150, 2009, Springer, 978-3-642-02929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | G. Zeibig |
Coherence for Product Monoids and their Actions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 14(3), pp. 215-227, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 9(3), pp. 167-192, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
symbolic constraints, built-in theories, automated deduction, term orderings |
28 | Markus Lohrey |
Decidability and Complexity in Automatic Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings, pp. 308-320, 2004, Springer, 3-540-24014-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Hajime Machida, Ivo G. Rosenberg |
Monoids whose Centralizer is the Least Clone. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 19-22 May 2004, Toronto, Canada, pp. 102-108, 2004, IEEE Computer Society, 0-7695-2130-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Clone, centralizer, monoid |
28 | Bas Luttik |
A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, pp. 562-571, 2003, Springer, 3-540-40671-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas |
Using Transitive-Closure Logic for Deciding Linear Properties of Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, pp. 378-387, 2003, Springer, 3-540-40671-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers, pp. 43-58, 2002, Springer, 3-540-40431-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | G. Chevalier, Sylvia Pulmannová |
Some Ideal Lattices in Partial Abelian Monoids and Effect Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 17(1), pp. 75-92, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 278-289, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Jochen Meßner |
Pattern Matching in Trace Monoids (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 571-582, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: Types for Proofs and Programs, International Workshop TYPES'95, Torino, Italy, June 5-8, 1995, Selected Papers, pp. 47-61, 1995, Springer, 3-540-61780-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Manfred Droste |
A KLeene Theorem for Recognizable Languages over Concurrency Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 388-399, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
28 | Danièle Beauquier, Andreas Podelski |
Rabin Tree Automata and Finite Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings, pp. 262-271, 1993, Springer, 3-540-57182-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
28 | Thomas Deiß |
Conditional Seme-Thue Systems for Presenting Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings, pp. 557-565, 1992, Springer, 3-540-55210-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
28 | Alois P. Heinz |
Finding Two-Tree-Factor Elements of Tableau-Defined Monoids in Time O(n³). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, Proceedings, pp. 120-128, 1990, Springer, 3-540-53504-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 35(4), pp. 941-952, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
28 | Jacques Sakarovitch |
An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1976, 5th Symposium, Gdansk, Poland, September 6-10, 1976, Proceedings, pp. 510-516, 1976, Springer, 0-387-07854-1. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
24 | Symeon Bozapalidis, Archontia Grammatikopoulou |
An Eilenberg Theorem for Pictures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAI ![In: Algebraic Informatics, Third International Conference, CAI 2009, Thessaloniki, Greece, May 19-22, 2009, Proceedings, pp. 172-188, 2009, Springer, 978-3-642-03563-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Paolo Baldan, Fabio Gadducci |
Petri Nets Are Dioids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMAST ![In: Algebraic Methodology and Software Technology, 12th International Conference, AMAST 2008, Urbana, IL, USA, July 28-31, 2008, Proceedings, pp. 51-66, 2008, Springer, 978-3-540-79979-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Fabio Burderi, Antonio Restivo |
Varieties of Codes and Kraft Inequality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 40(4), pp. 507-520, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Lucien Haddad, Hajime Machida, Ivo G. Rosenberg |
Monoidal Intervals of Partial Clones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 37th International Symposium on Multiple-Valued Logic, ISMVL 2007, 13-16 May 2007, Oslo, Norway, pp. 9, 2007, IEEE Computer Society, 978-0-7695-2831-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|