The following pages link to (Q5639639):
Displayed 50 items.
- Efficient enumeration of words in regular languages (Q840765) (← links)
- Normal design algebra (Q844885) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- Axiomatizing the identities of binoid languages (Q870834) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Proving language inclusion and equivalence by coinduction (Q899321) (← links)
- A note on ambiguity in context-free grammars (Q911784) (← links)
- Local variable scoping and Kleene algebra with tests (Q929964) (← links)
- Universal automata and NFA learning (Q954990) (← links)
- Weighted automata with discounting (Q963467) (← links)
- Decision problems for language equations (Q972384) (← links)
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? (Q979076) (← links)
- Characterizations of hemirings by their \(h\)-ideals. (Q988352) (← links)
- Computational complementarity and shift spaces (Q997483) (← links)
- An algebra of hybrid systems (Q1001892) (← links)
- A note on an expressiveness hierarchy for multi-exit iteration (Q1014386) (← links)
- Conjugacy of finite biprefix codes (Q1019714) (← links)
- The iterated prisoner's dilemma in societies of deterministic players (Q1044969) (← links)
- An application of the matrix representation of transductions (Q1057659) (← links)
- A regularity test for dual bordered OS systems (Q1060851) (← links)
- Computation theory of cellular automata (Q1072705) (← links)
- On total regulators generated by derivation relations (Q1084874) (← links)
- Transitive closure and related semiring properties via eliminants (Q1089083) (← links)
- Brzozowski hierarchy of \(\omega\)-languages (Q1095672) (← links)
- On regular trace languages (Q1097040) (← links)
- On the active and full use of memory in right-boundary grammars and push- down automata (Q1099637) (← links)
- On flowchart theories. II: The nondeterministic case (Q1101203) (← links)
- Monoides et semi-anneaux continus. (Continuous monoids and semirings) (Q1105674) (← links)
- The equational theory of pomsets (Q1119012) (← links)
- Equational properties of iteration in algebraically complete categories (Q1128480) (← links)
- On generalized language equations (Q1149791) (← links)
- Complete systems of \(\mathcal B\)-rational identities (Q1177930) (← links)
- Dynamic algebras: Examples, constructions, applications (Q1189900) (← links)
- On transductions of formal power series over complete semirings (Q1194315) (← links)
- On limits in complete semirings (Q1194435) (← links)
- Models of a \(K\)-rational identity system (Q1201883) (← links)
- Algebraic structures for transitive closure (Q1238415) (← links)
- A simplified proof of Parikh's theorem (Q1241068) (← links)
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921) (← links)
- On rational series and rational languages (Q1275092) (← links)
- Group axioms for iteration (Q1283821) (← links)
- On language equations with invertible operations (Q1334659) (← links)
- A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring (Q1341738) (← links)
- Periodic sets of integers (Q1342238) (← links)
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths (Q1343157) (← links)
- Notes on equational theories of relations (Q1344844) (← links)
- An equational axiomatization for multi-exit iteration (Q1369097) (← links)
- Physical versus computational complementarity. I (Q1376456) (← links)