Automata in general algebras
From MaRDI portal
Publication:5565124
DOI10.1016/S0019-9958(67)90670-5zbMATH Open0175.27902MaRDI QIDQ5565124FDOQ5565124
Jesse B. Wright, Samuel Eilenberg
Publication date: 1967
Published in: Information and Control (Search for Journal in Brave)
Cited In (57)
- Regular planar monoidal languages
- Monadic monadic second order logic
- Automata in categories. The decomposition problem
- Inference for regular bilanguages
- Machines in a category
- Title not available (Why is that?)
- Morphismes et bimorphismes d'arbres
- Natural state transformations
- Semantic preserving translations
- Object grammars and bijections.
- Paracategories. II: Adjunctions, fibrations and examples from probabilistic automata theory
- Commutativity in free inverse monoids
- Nondeterministic operations on finite relational structures
- Primitive recursive algebraic theories and program schemes
- Title not available (Why is that?)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Rationality in algebras with a series operation
- A class of fuzzy theories
- Varieties of chain-complete algebras
- Associativity of products of existence varieties of regular semigroups
- On the algebraic structure of rooted trees
- E-unitary inverse monoids and the Cayley graph of a group presentation
- Generalized sequential machine maps
- A generalized approach to formal languages
- A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
- Deux applications de la représentation matricielle d'une série rationnelle non commutative. (Two applications of matrix representations of a rational non -commutative series)
- Derivatives of rational expressions with multiplicity
- The existence and construction of free iterative theories
- Matricial theories
- Classes of finite relations as initial abstract data types. II
- On rational series and rational languages
- Graph automata
- Determinants and Möbius functions in trace monoids
- Graph expressions and graph rewritings
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories
- A hidden agenda
- Transformations of structures: An algebraic approach
- The common algebraic structure of exit-automata and machines
- Organismic supercategores: II. On multistable systems
- Quelques propriétés algébriques des automates
- Regular trees and the free iterative theory
- A proof of Choffrut's theorem on subsequential functions
- Graph congruences and wreath products
- Categories, relations and dynamic programming
- Correctness of recursive parallel nondeterministic flow programs
- P-varieties - a signature independent characterization of varieties of ordered algebras
- Init and Anf operating on \(\omega\)-languages
- Algebraic recognizability of regular tree languages
- On a multiplication of semigroup varieties
- All solutions of a system of recursion equations in infinite trees and other contraction theories
- Recursion-closed algebraic theories
- On rational definitions in complete algebras without rank
- Some reasons for generalising domain theory
- Fuzzy semirings
- Systematic approach to reduction and minimization in automata and system theory
- Minimal realization of machines in closed categories
This page was built for publication: Automata in general algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565124)
