The problem of functional completeness of metaalgebras of regular events

DOI10.1023/A:1009497008248zbMath1010.68217OpenAlexW1524880787MaRDI QIDQ5942110

G. E. Tseitlin

Publication date: 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009497008248

zbMATH Keywords

algebraic foundations of algorithmics

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General topics in the theory of algorithms (68W01)

Related Items (2)

Algebraic-algorithmic means for designing knowledge of object domains ⋮ Formalization of algorithmic knowledge of object domains in terms of the algebra of algorithmics

This page was built for publication: The problem of functional completeness of metaalgebras of regular events