The following pages link to (Q5639639):
Displaying 50 items.
- Varieties and covarieties of languages (extended abstract) (Q265785) (← links)
- Fuzzy terms (Q277347) (← links)
- The universal fuzzy automaton (Q279373) (← links)
- Pair algebras and Galois connections. (Q293350) (← links)
- On syntactic nuclei of rational languages (Q293361) (← links)
- An algebraic approach to computations with progress (Q299188) (← links)
- Algorithms for Kleene algebra with converse (Q299194) (← links)
- Developments in concurrent Kleene algebra (Q299202) (← links)
- Generalised rely-guarantee concurrency: an algebraic foundation (Q333330) (← links)
- On the computation of quotients and factors of regular languages (Q351995) (← links)
- Free inductive \(K\)-semialgebras (Q383784) (← links)
- Weighted finite automata over hemirings (Q388788) (← links)
- Path sets in one-sided symbolic dynamics (Q402586) (← links)
- Hopscotch -- reaching the target hop by hop (Q406451) (← links)
- Free iterative and iteration \(K\)-semialgebras (Q412016) (← links)
- On algebra of languages representable by vertex-labeled graphs (Q418730) (← links)
- Container of (min,+)-linear systems (Q457194) (← links)
- Hidden protocols: modifying our expectations in an evolving world (Q490513) (← links)
- Characterizations of hemirings in terms of cubic \(h\)-ideals (Q521689) (← links)
- Fixing Zeno gaps (Q549197) (← links)
- Algebraic separation logic (Q549676) (← links)
- Concurrent Kleene algebra and its foundations (Q549679) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Subsequential transducers: a coalgebraic perspective (Q618167) (← links)
- Completeness for flat modal fixpoint logics (Q638475) (← links)
- Analogues of quantum complementarity in the theory of automata (Q639815) (← links)
- Axiomatizability of positive algebras of binary relations (Q647324) (← links)
- The equational theory of Kleene lattices (Q655418) (← links)
- Representation theory of finite semigroups over semirings. (Q657946) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Rewriting extended regular expressions (Q673635) (← links)
- Equational properties of Kleene algebras of relations with conversion (Q674338) (← links)
- Empirical logic of finite automata: Microstatements versus macrostatements (Q675042) (← links)
- Rewriting of regular expressions and regular path queries (Q696951) (← links)
- Introducing VAUCANSON (Q703498) (← links)
- A coalgebraic approach to Kleene algebra with tests (Q703519) (← links)
- Synchronous Kleene algebra (Q710676) (← links)
- Algebras for iteration and infinite computations (Q715050) (← links)
- The set of realizations of a max-plus linear sequence is semi-polyhedral (Q716317) (← links)
- Regular expression order-sorted unification and matching (Q741252) (← links)
- On regularity of context-free languages (Q759489) (← links)
- Equational weighted tree transformations (Q766185) (← links)
- Computational complementarity (Q789384) (← links)
- The residue of vector sets with applications to decidability problems in Petri nets (Q797285) (← links)
- Wolfram's class IV automata and a good Life (Q807049) (← links)
- Regular algebra applied to language problems (Q817577) (← links)
- Kleene under a modal demonic star (Q817579) (← links)
- Abstract abstract reduction (Q817587) (← links)
- Simplifying regular expressions further (Q820947) (← links)
