Languages recognized by a class of finite automata
From MaRDI portal
The authors consider automata defined by left multiplications in graph algebras and describe all languages recognized by these automata in terms of combinatorial properties of words which belong to these languages, regular expressions and linear grammars defining these languages.
Recommendations
Cited in
(16)- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages)
- Finite-state unification automata and relational languages
- On congruences of automata defined by directed graphs
- DM-automata and classes of context-free languages
- Language Recognition Power and Succinctness of Affine Automata
- scientific article; zbMATH DE number 3858446 (Why is no real title available?)
- Path algebras and finite automata.
- scientific article; zbMATH DE number 4001511 (Why is no real title available?)
- Two Algorithms For Languages Recognized By Graph Algebras
- scientific article; zbMATH DE number 2108136 (Why is no real title available?)
- Languages accepted by integer weighted finite automata
- Automata to recognize finite and infinite words with at least two factorizations on a given finite set
- Language acceptability of finite automata based on theory of semi-tensor product of matrices
- On a superclass of A-grammars
- scientific article; zbMATH DE number 4187120 (Why is no real title available?)
This page was built for publication: Languages recognized by a class of finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770583)
