The following pages link to (Q5639639):
Displayed 50 items.
- Nonaxiomatisability of equivalences over finite state processes (Q1377607) (← links)
- Deterministic automata. Simulation, universality and minimality (Q1377610) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- A calculational approach to mathematical induction (Q1391737) (← links)
- Completeness of Park induction (Q1391869) (← links)
- The multiplicative fragment of the Yanov equational theory (Q1399998) (← links)
- On the equational definition of the least prefixed point. (Q1401250) (← links)
- Algebraic rewritings for optimizing regular path queries. (Q1401283) (← links)
- Derivatives of rational expressions and related theorems. (Q1426157) (← links)
- Finite nondeterministic automata: simulation and minimality (Q1575547) (← links)
- Language preorder as a precongruence (Q1575654) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- Characterizing determinacy in Kleene algebras (Q1602558) (← links)
- The commutation of finite sets: A challenging problem (Q1605327) (← links)
- Representation of normal bands as semigroups of \(k\)-bi-ideals of a semiring (Q1646605) (← links)
- A congruence on the semiring of normal tropical matrices (Q1654409) (← links)
- On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
- Language equations, maximality and error-detection (Q1765227) (← links)
- A note on identities of two-dimensional languages (Q1765373) (← links)
- Algebraically complete semirings and Greibach normal form (Q1772777) (← links)
- A type checking algorithm for concurrent object protocols (Q1785846) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Kleene algebra of partial predicates (Q1796766) (← links)
- Invariants and closures in the theory of rewrite systems (Q1815344) (← links)
- On axioms for commutative regular equations without addition. (Q1853544) (← links)
- Conway's problem for three-word sets. (Q1853553) (← links)
- Automata, Boolean matrices, and ultimate periodicity. (Q1854295) (← links)
- On equations for union-free regular languages (Q1854402) (← links)
- A non-ambiguous decomposition of regular languages and factorizing codes (Q1861571) (← links)
- The max-plus algebra of the natural numbers has no finite equational basis (Q1870591) (← links)
- Equational theories of tropical semirings (Q1874279) (← links)
- Inductive \(^{*}\)-semirings (Q1882911) (← links)
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series (Q1884876) (← links)
- Some properties of Ising automata (Q1884924) (← links)
- A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) (Q1887138) (← links)
- Automaton partition logic versus quantum logic (Q1907594) (← links)
- Automaton logic (Q1916271) (← links)
- Critical points for least-squares problems involving certain analytic functions, with applications to sigmoidal nets (Q1923891) (← links)
- Typing theorems of omega algebra (Q1931900) (← links)
- Left omega algebras and regular equations (Q1931903) (← links)
- Towards a linear algebra of programming (Q1941862) (← links)
- Dijkstra, Floyd and Warshall meet Kleene (Q1941863) (← links)
- Parikh's theorem: a simple and direct automaton construction (Q1944966) (← links)
- Computational power of two stacks with restricted communication (Q1959441) (← links)
- Petri net languages and infinite subsets of \(\mathbb{N}^m\) (Q1970198) (← links)
- The variety of Kleene algebras with conversion is not finitely based (Q1978513) (← links)
- Verifying minimum spanning tree algorithms with Stone relation algebras (Q1994364) (← links)
- Some properties of inclusions of multisets and contractive Boolean operators (Q2017048) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Equational theories for automata (Q2074221) (← links)