The following pages link to (Q5639639):
Displayed 50 items.
- Language equations (Q2074222) (← links)
- Nonfinitely based ai-semirings with finitely based semigroup reducts (Q2079231) (← links)
- A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- Conway's work on iteration (Q2153969) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- Dynamic Łukasiewicz logic and dynamic MV-algebras (Q2206432) (← links)
- Nondeterministic syntactic complexity (Q2233426) (← links)
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- Simple equations on binary factorial languages (Q2271433) (← links)
- Left-handed completeness (Q2286746) (← links)
- A family of graded epistemic logics (Q2333311) (← links)
- Modal algebra and Petri nets (Q2340252) (← links)
- Infinite executions of lazy and strict computations (Q2347906) (← links)
- Multirelational representation theorems for complete idempotent left semirings. (Q2347913) (← links)
- On the fine-structure of regular algebra (Q2352506) (← links)
- Matrix and matricial iteration theories. I (Q2366691) (← links)
- Matrix and matricial iteration theories. II (Q2366692) (← links)
- Operations preserving regular languages (Q2368978) (← links)
- Factor theory and the unity of opposites (Q2374299) (← links)
- An exercise on the generation of many-valued dynamic logics (Q2374313) (← links)
- Playing with Conway's problem (Q2378537) (← links)
- Axiomatizing rational power series over natural numbers (Q2389332) (← links)
- Inductive semimodules and the vector modules over them. (Q2391239) (← links)
- Weighted simple reset pushdown automata (Q2422031) (← links)
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) (Q2437851) (← links)
- Matrix Code (Q2441509) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- Theory of átomata (Q2453119) (← links)
- Computational universes (Q2483574) (← links)
- Commutation with codes (Q2484442) (← links)
- A topological approach to transductions (Q2484451) (← links)
- Computing by commuting. (Q2490820) (← links)
- Fuzzy regular languages over finite and infinite words (Q2493980) (← links)
- Distributive laws for the coinductive solution of recursive equations (Q2495644) (← links)
- On the complexity of reasoning in Kleene algebra (Q2506487) (← links)
- Regular solutions of language inequalities and well quasi-orders (Q2581271) (← links)
- Metabolic isotopomer labeling systems. III: Path tracing (Q2637572) (← links)
- Components and acyclicity of graphs. An exercise in combining precision with concision (Q2667191) (← links)
- Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata (Q2672253) (← links)
- On quotients of formal power series (Q2672254) (← links)
- Flat extensions of groups and limit varieties of additively idempotent semirings (Q2694733) (← links)
- Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (Q2695356) (← links)
- Types from Frames as Finite Automata (Q2835042) (← links)
- THE VALIDITY OF WEIGHTED AUTOMATA (Q2842025) (← links)
- Unique, guarded fixed points in an additive setting (Q2842814) (← links)
- (Q2842862) (← links)
- Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic (Q2864394) (← links)
- Conway and iteration hemirings Part 1 (Q2876612) (← links)
- THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093) (← links)