Alphabet operators and algorithms

DOI10.1007/BF01130083MaRDI QIDQ1895046zbMATH OpenFDO

Authors Yu. M. Borodyanskij, Mark Burgin

Publication date 6 August 1995

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

zbMATH Keywords

finite automataTuring machinestheory of algorithmsalphabet operators

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10)

Recommendations

• scientific article; zbMATH DE number 3936508
• scientific article; zbMATH DE number 3212011
• scientific article; zbMATH DE number 517393
• Algebraic string operations
• scientific article; zbMATH DE number 1381690
• scientific article; zbMATH DE number 4058861
• scientific article; zbMATH DE number 1533635

Cites work

• scientific article; zbMATH DE number 4181414 (Why is no real title available?)
• scientific article; zbMATH DE number 59352 (Why is no real title available?)
• Extension of not everywhere defined functions of many-valued logic
• Maximal local classes of partial functions of infinite-valued logic
• The Galois connection between partial operations and relations
• The algebras of partial functions and their invariants
• Une généralisation de la notion de corps
• Universal algebras with all operations of bounded range

Cited in

(2)

• Algebraic string operations
• Glushkov's evidence algorithm

This page was built for publication: Alphabet operators and algorithms

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