Pages that link to "Item:Q4279247"

The following pages link to Equational axioms for regular sets (Q4279247):

Displaying 48 items.

• A connection between concurrency and language theory (Q265802) (← links)
• Bisimulations for fuzzy automata (Q423147) (← links)
• On the geometry and algebra of networks with state (Q517043) (← links)
• Fixing Zeno gaps (Q549197) (← links)
• Equational properties of iterative monads (Q618163) (← links)
• Fixed-point operations on ccc's. I (Q672122) (← links)
• Equational properties of Kleene algebras of relations with conversion (Q674338) (← links)
• The calculus of signal flow diagrams. I: Linear relations on streams. (Q729807) (← links)
• Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
• Axiomatizing the identities of binoid languages (Q870834) (← links)
• Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure (Q890383) (← links)
• Completions of \(\mu \)-algebras (Q925850) (← links)
• Equational properties of iteration in algebraically complete categories (Q1128480) (← links)
• On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921) (← links)
• Group axioms for iteration (Q1283821) (← links)
• A completeness theorem for Kleene algebras and the algebra of regular events (Q1327385) (← links)
• On dynamic algebras (Q1341742) (← links)
• Notes on equational theories of relations (Q1344844) (← links)
• An equational axiomatization for multi-exit iteration (Q1369097) (← links)
• Nonaxiomatisability of equivalences over finite state processes (Q1377607) (← links)
• Axiomatizing shuffle and concatenation in languages (Q1383153) (← links)
• The equational logic of fixed points (Q1391734) (← links)
• Completeness of Park induction (Q1391869) (← links)
• Recursion and corecursion have the same equational logic (Q1398467) (← links)
• Infinite trees and completely iterative theories: A coalgebraic view (Q1399957) (← links)
• The multiplicative fragment of the Yanov equational theory (Q1399998) (← links)
• On the equational definition of the least prefixed point. (Q1401250) (← links)
• On axioms for commutative regular equations without addition. (Q1853544) (← links)
• Automata, Boolean matrices, and ultimate periodicity. (Q1854295) (← links)
• On equations for union-free regular languages (Q1854402) (← links)
• Inductive \(^{*}\)-semirings (Q1882911) (← links)
• The variety of Kleene algebras with conversion is not finitely based (Q1978513) (← links)
• Equational theories for automata (Q2074221) (← links)
• A string diagrammatic axiomatisation of finite-state automata (Q2233427) (← 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)
• Axiomatizing rational power series over natural numbers (Q2389332) (← links)
• On the complexity of reasoning in Kleene algebra (Q2506487) (← links)
• Matrices, machines and behaviors (Q2563761) (← links)
• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics (Q3130301) (← links)
• Iteration Semirings (Q3532996) (← links)
• Domain mu-calculus (Q4460689) (← links)
• An Equational Axiomatization of Bisimulation over Regular Expressions (Q4542240) (← links)
• Nonfinite axiomatizability of the equational theory of shuffle (Q4645164) (← links)
• A Finite Axiomatisation of Finite-State Automata Using String Diagrams (Q5883739) (← links)
• Parametric corecursion (Q5941163) (← links)
• The algebra of stream processing functions (Q5941194) (← links)