scientific article; zbMATH DE number 3366846

Cited in

(only showing first 100 items - show all)

An algebra of hybrid systems
A note on an expressiveness hierarchy for multi-exit iteration
Conjugacy of finite biprefix codes
The iterated prisoner's dilemma in societies of deterministic players
An application of the matrix representation of transductions
A regularity test for dual bordered OS systems
Computation theory of cellular automata
On total regulators generated by derivation relations
Transitive closure and related semiring properties via eliminants
Brzozowski hierarchy of \(\omega\)-languages
On regular trace languages
On the active and full use of memory in right-boundary grammars and push- down automata
On flowchart theories. II: The nondeterministic case
Monoides et semi-anneaux continus. (Continuous monoids and semirings)
The equational theory of pomsets
Equational properties of iteration in algebraically complete categories
On generalized language equations
Complete systems of \(\mathcal B\)-rational identities
Dynamic algebras: Examples, constructions, applications
On transductions of formal power series over complete semirings
On limits in complete semirings
Models of a \(K\)-rational identity system
Algebraic structures for transitive closure
A simplified proof of Parikh's theorem
On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based
On rational series and rational languages
Group axioms for iteration
On language equations with invertible operations
A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring
Periodic sets of integers
Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
Notes on equational theories of relations
An equational axiomatization for multi-exit iteration
Physical versus computational complementarity. I
Nonaxiomatisability of equivalences over finite state processes
Deterministic automata. Simulation, universality and minimality
The equational logic of fixed points
A calculational approach to mathematical induction
Completeness of Park induction
The multiplicative fragment of the Yanov equational theory
On the equational definition of the least prefixed point.
Algebraic rewritings for optimizing regular path queries.
Derivatives of rational expressions and related theorems.
Finite nondeterministic automata: simulation and minimality
Language preorder as a precongruence
\(L(A)=L(B)\)? decidability results from complete formal systems
Characterizing determinacy in Kleene algebras
The commutation of finite sets: A challenging problem
Representation of normal bands as semigroups of \(k\)-bi-ideals of a semiring
A congruence on the semiring of normal tropical matrices
On series-parallel pomset languages: rationality, context-freeness and automata
Language equations, maximality and error-detection
A note on identities of two-dimensional languages
Algebraically complete semirings and Greibach normal form
A type checking algorithm for concurrent object protocols
An algebraic framework for minimum spanning tree problems
Kleene algebra of partial predicates
Invariants and closures in the theory of rewrite systems
On axioms for commutative regular equations without addition.
Conway's problem for three-word sets.
Automata, Boolean matrices, and ultimate periodicity.
On equations for union-free regular languages
A non-ambiguous decomposition of regular languages and factorizing codes
The max-plus algebra of the natural numbers has no finite equational basis
Equational theories of tropical semirings
Inductive \(^{*}\)-semirings
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Some properties of Ising automata
A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\)
Automaton partition logic versus quantum logic
Automaton logic
Critical points for least-squares problems involving certain analytic functions, with applications to sigmoidal nets
Typing theorems of omega algebra
Left omega algebras and regular equations
Towards a linear algebra of programming
Dijkstra, Floyd and Warshall meet Kleene
Parikh's theorem: a simple and direct automaton construction
Computational power of two stacks with restricted communication
Petri net languages and infinite subsets of \(\mathbb{N}^m\)
The variety of Kleene algebras with conversion is not finitely based
Verifying minimum spanning tree algorithms with Stone relation algebras
Some properties of inclusions of multisets and contractive Boolean operators
Automata and rational expressions
Equational theories for automata
Language equations
Nonfinitely based ai-semirings with finitely based semigroup reducts
A denotational semantics for low-level probabilistic programs with nondeterminism
Axiomatizing recursion-free, regular monitors
Conway's work on iteration
Manipulation of regular expressions using derivatives: an overview
Dynamic Łukasiewicz logic and dynamic MV-algebras
Nondeterministic syntactic complexity
Computational completeness of equations over sets of natural numbers
Simple equations on binary factorial languages
Left-handed completeness
A family of graded epistemic logics
Modal algebra and Petri nets
Infinite executions of lazy and strict computations
Multirelational representation theorems for complete idempotent left semirings.
On the fine-structure of regular algebra

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5639639)