BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
finit (18)
free (8)
problem (6)
trace (6)
automata (6)

Stem monoid$ (all stems)

54 papers:

DLTDLT-2015-BrandlS #analysis #automaton #complexity #finite #monad
Complexity Analysis: Transformation Monoids of Finite Automata (CB, HUS), pp. 143–154.
PPDPPPDP-2015-RivasJS #monad
From monoids to near-semirings: the essence of MonadPlus and alternative (ER, MJ, TS), pp. 196–207.
POPLPOPL-2015-JungSSSTBD #concurrent #invariant #monad #named #orthogonal #reasoning
Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning (RJ, DS, FS, KS, AT, LB, DD), pp. 637–650.
RTARTA-2013-GuiraudMM #monad #topic
A Homotopical Completion Procedure with Applications to Coherence of Monoids (YG, PM, SM), pp. 223–238.
CIAACIAA-J-2010-DrosteM11 #automaton #monad #regular expression
Weighted Automata and Regular Expressions over Valuation Monoids (MD, IM), pp. 1829–1844.
ICALPICALP-v2-2011-Zetzsche #automaton #monad #on the #transducer
On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (GZ), pp. 222–233.
LATALATA-2011-CorranHKT #automation #finite #monad
Singular Artin Monoids of Finite Coxeter Type Are Automatic (RC, MH, DK, RMT), pp. 250–261.
ICALPICALP-v2-2009-BeaudryL #monad
Faithful Loops for Aperiodic E-Ordered Monoids (MB, FL), pp. 55–66.
ICALPICALP-v2-2009-Colcombet #cost analysis #formal method #monad
The Theory of Stabilisation Monoids and Regular Cost Functions (TC), pp. 139–150.
DLTDLT-J-2007-BertoniR08 #approximate #monad
Approximating the Mean Speedup in Trace Monoids (AB, RR), pp. 497–511.
DLTDLT-2007-BertoniR #monad
Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids (AB, RR), pp. 72–83.
CIAACIAA-J-2004-KrawetzLS05 #complexity #finite #monad #set
State complexity and the monoid of transformations of a finite set (BK, JL, JS), pp. 547–563.
DLTDLT-J-2004-Lohrey05 #automation #complexity #decidability #monad
Decidability and complexity in automatic monoids (ML), pp. 707–722.
CIAACIAA-2004-KrawetzLS #complexity #finite #monad #set
State Complexity and the Monoid of Transformations of a Finite Set (BK, JL, JS), pp. 213–224.
CIAACIAA-2004-Maletti #theorem #transducer
Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids (AM), pp. 323–324.
DLTDLT-2004-Lohrey #automation #complexity #decidability #monad
Decidability and Complexity in Automatic Monoids (ML), pp. 308–320.
DLTDLT-2003-HolzerK #automaton #finite #monad #on the
On Deterministic Finite Automata and Syntactic Monoid Size, Continued (MH, BK), pp. 349–360.
DLTDLT-2002-Esik #finite #generative #logic #monad #word
Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators (), pp. 43–58.
DLTDLT-2002-HolzerK02a #automaton #finite #monad #on the
On Deterministic Finite Automata and Syntactic Monoid Size (MH, BK), pp. 258–269.
ICALPICALP-2002-KuskeL #formal method #monad #on the
On the Theory of One-Step Rewriting in Trace Monoids (DK, ML), pp. 752–763.
ICALPICALP-2001-Kirsten #monad #problem #reduction
The Star Problem in Trace Monoids: Reductions Beyond C4 (DK), pp. 591–602.
LICSLICS-2001-GodoyN #constraints #deduction #monad #on the
On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups (GG, RN), pp. 38–47.
WLCWLC-2000-Inata #monad
Presentations of Right Unitary Submonoids of Monoids (II), pp. 222–227.
WLCWLC-2000-KelarevT #combinator #monad
A Combinatorial Property of Languages and Monoids (AVK, PGT), pp. 228–239.
PPDPPPDP-2000-HylandP #sketching #symmetry
Symmetric monoidal sketches (MH, JP), pp. 280–288.
ICALPICALP-1999-Kirsten #finite #monad #problem
A Connection between the Star Problem and the Finite Power Property in Trace Monoids (DK), pp. 473–482.
RTARTA-1998-OttoSM #automation #convergence #finite #monad
Automatic Monoids Versus Monoids with Finite Convergent Presentations (FO, ASK, KM), pp. 32–46.
RTARTA-1997-OttoKK #decidability #monad #problem #word
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems (FO, MK, YK), pp. 53–67.
RTARTA-1997-Sattler-Klein #monad
New Undecidablility Results for Finitely Presented Monoids (ASK), pp. 68–82.
TLCATLCA-1997-Hasegawa #category theory #modelling #recursion #λ-calculus
Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic λ Calculi (MH), pp. 196–213.
CADECADE-1996-GanzingerW #monad #proving #theorem proving
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract) (HG, UW), pp. 388–402.
CSLCSL-1996-Statman #monad #on the
On Cartesian Monoids (RS), pp. 446–459.
RTARTA-1996-Madlener #monad
Applications of Rewrite Techniques in Monoids and Rings (Abstract) (KM), p. 260.
ICALPICALP-1994-Droste #concurrent #monad #theorem
A KLeene Theorem for Recognizable Languages over Concurrency Monoids (MD), pp. 388–399.
RTARTA-1993-Adian #algorithm #monad #on the #problem
On some Algorithmic Problems for Groups and Monoids (SIA), pp. 289–300.
ICALPICALP-1991-DuchampK #commutative #monad
Lazard’s Factorizations of Free Partially Commutative Monoids (GD, DK), pp. 242–253.
LICSLICS-1991-Statman #combinator #monad
Freyd’s Hierarchy of Combinator Monoids (RS), pp. 186–190.
RTARTA-1991-BaaderN #algebra #commutative #equation #how #morphism #unification
Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification (FB, WN), pp. 124–135.
CADECADE-1990-Nutt #unification
Unification in Monoidal Theories (WN), pp. 618–632.
RTARTA-1989-Pedersen #monad
Morphocompletion for One-Relation Monoids (JP), pp. 574–578.
ICALPICALP-1988-Diekert #commutative #for free #monad #transitive
Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids (VD), pp. 176–187.
LICSLICS-1988-MeseguerM #algebra #monad #petri net
Petri Nets Are Monoids: A New Algebraic Foundation for Net Theory (JM, UM), pp. 155–164.
STOCSTOC-1987-BarringtonT #finite #monad
Finite Monoids and the Fine Structure of NC¹ (DAMB, DT), pp. 101–109.
ICALPICALP-1987-ChoffrutD #monad #problem
A Star-Height Problem in Free Monoids with Partial Communications (CC, CD), pp. 190–201.
RTARTA-1987-SquierO #canonical #finite #monad #problem #term rewriting #word
Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems (CCS, FO), pp. 74–82.
ICALPICALP-1986-Metivier #commutative #monad #on the #set
On Recognizable Subsets of Free Partially Commutative Monoids (YM), pp. 254–264.
ICALPICALP-1985-Pin #finite #for free #monad
Finite Group Topology and p-Adic Topology for Free Monoids (JÉP), pp. 445–455.
RTARTA-1985-Otto #algebra #finite #monad
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems (FO), pp. 95–106.
ICALPICALP-1983-Karhumaki #monad
A Note on Intersections of Free Submonoids of a Free Monoid (JK), pp. 397–407.
ICALPICALP-1978-Restivo #monad #set
Some Decision Results for Recognizable Sets in Arbitrary Monoids (AR), pp. 363–371.
ICGTGG-1978-ArbibM #algebra #monad #recursion #semantics
Partially-Additive Monoids, Graph-Growing, and the Algebraic Semantics of Recursive Calls (MAA, EGM), pp. 127–138.
POPLPOPL-1978-Rosen #agile #analysis #data flow #monad
Monoids for Rapid Data Flow Analysis (BKR), pp. 47–59.
ICALPICALP-1972-Lentin #equation #monad
Equations in Free Monoids (AL), pp. 67–85.
STOCSTOC-1970-Perrot #automaton #finite #monad #on the
On The Relationship between Finite Automata, Finite Monoids, and Prefix Codes (JFP), pp. 217–220.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.