Finite-state automata in information technologies

DOI10.1007/s10559-011-9347-xzbMath1358.68216OpenAlexW2050696740MaRDI QIDQ464949

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

verificationBüchi automatonfinite-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)

Cites Work

• A polynomial algorithm for solving systems of two linear diophantine equations
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Efficient solution of linear diophantine equations
• Splicing semigroups of dominoes and DNA
• What's decidable about hybrid automata?
• General varieties of tree languages
• A theory of timed automata
• THE ABSTRACT THEORY OF AUTOMATA
• An algorithm to construct the basis of the intersection of finitely generated free groups
• Splicing systems and regularity
• An efficient algorithm for constructing the basis of a subgroup of a free group
• Automata Theory with Modern Applications
• Formal Modeling and Analysis of Timed Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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