Finite-state automata in information technologies

DOI10.1007/S10559-011-9347-XMaRDI QIDQ464949zbMATH OpenOpenAlexFDO

Authors S. L. Kryvyi

Publication date 30 October 2014

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

Full work available at URL https://doi.org/10.1007/s10559-011-9347-x

zbMATH Keywords

verification[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=B%EF%BF%BD%EF%BF%BDchi+automaton&go=Go B��chi automaton]finite-state automatonMuller automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2150274
• Finite automata
• Finite automata
• scientific article; zbMATH DE number 6300094
• Finite automata
• Finite-state techniques. Automata, transducers and bimachines
• Theory of finite automata
• THEORY OF FINITE AUTOMATA
• Finite automata in the mathematical theory of programming
• Finite-memory automata

Cites work

• scientific article; zbMATH DE number 1615755 (Why is no real title available?)
• scientific article; zbMATH DE number 3427224 (Why is no real title available?)
• scientific article; zbMATH DE number 3168668 (Why is no real title available?)
• scientific article; zbMATH DE number 3990877 (Why is no real title available?)
• scientific article; zbMATH DE number 4070321 (Why is no real title available?)
• scientific article; zbMATH DE number 4125033 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 3254910 (Why is no real title available?)
• A polynomial algorithm for solving systems of two linear diophantine equations
• A theory of timed automata
• An algorithm to construct the basis of the intersection of finitely generated free groups
• An efficient algorithm for constructing the basis of a subgroup of a free group
• Automata Theory with Modern Applications
• Efficient solution of linear diophantine equations
• Formal Modeling and Analysis of Timed Systems
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• General varieties of tree languages
• Splicing semigroups of dominoes and DNA
• Splicing systems and regularity
• THE ABSTRACT THEORY OF AUTOMATA
• What's decidable about hybrid automata?

Cited in

(8)

• Finite automata and morphisms in assisted musical composition*
• The finite automata approaches in stringology
• A VLSI design for the parallel finite state automaton and its performance evaluation as a hardware scanner
• Minimal state automata for detecting a \(\beta\) globin gene mutation
• scientific article; zbMATH DE number 1512078 (Why is no real title available?)
• scientific article; zbMATH DE number 1479635 (Why is no real title available?)
• Finite state automata in compilers
• Grammars of organic chemistry

This page was built for publication: Finite-state automata in information technologies

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