scientific article; zbMATH DE number 3915631

MaRDI QIDQ3691065zbMATH OpenFDO

Authors Csaba Puskás

Publication date 1982

zbMATH Keywords

algorithmanalysis and synthesis of automata without outputsfinite automatalanguage matrix equationslanguage recognizerregular languages

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 3915632
• On solving automaton equations
• On rational solution of the state equation of a finite automaton
• Generalized language equations with multiple solutions
• scientific article; zbMATH DE number 4211530

Cited in

(13)

• On rational solution of the state equation of a finite automaton
• A matrix-linguistic method of analyzing finite discrete dynamic systems
• Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
• Solving language equations using flanked automata
• scientific article; zbMATH DE number 4211530 (Why is no real title available?)
• Matrix format of deterministic finite automata
• scientific article; zbMATH DE number 3915632 (Why is no real title available?)
• scientific article; zbMATH DE number 3926251 (Why is no real title available?)
• Classification and enumeration of matched free response matrices of linear finite automata
• On solving automaton equations
• Language acceptability of finite automata based on theory of semi-tensor product of matrices
• Language classes associated with automata over matrix groups
• A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages

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 Q3691065)