Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
201
result(s) for
"Sequential machine theory."
Sort by:
Digital electronics. Volume 3, Finite-state machines
Presents the principles of combinational and sequential logic and the underlying techniques for the analysis and design of digital circuits. The approach is gradual and relatively independent of each other chapters. To facilitate the assimilation and practical implementation of various concepts, the book is complemented by a selection of practical exercises corrected.
Book
Dynamics of the Box-Ball System with Random Initial Conditions via Pitman’s Transformation
The box-ball system (BBS), introduced by Takahashi and Satsuma in 1990, is a cellular automaton that exhibits solitonic behaviour. In
this article, we study the BBS when started from a random two-sided infinite particle configuration. For such a model, Ferrari et al.
recently showed the invariance in distribution of Bernoulli product measures with density strictly less than
eBook
Digital Electronics, Volume 3: Finite-state Machines
The book presents the principles of combinational and sequential logic and the underlying techniques for the analysis and design of digital circuits. The approach is gradual and relatively independent of each other chapters. To facilitate the assimilation and practical implementation of various concepts, the book is complemented by a selection of practical exercises.
eBook
Exploring efficient grouping algorithms in regular expression matching
Regular expression matching (REM) is widely employed as the major tool for deep packet inspection (DPI) applications. For automatic processing, the regular expression patterns need to be converted to a deterministic finite automata (DFA). However, with the ever-increasing scale and complexity of pattern sets, state explosion problem has brought a great challenge to the DFA based regular expression matching. Rule grouping is a direct method to solve the state explosion problem. The original rule set is divided into multiple disjoint groups, and each group is compiled to a separate DFA, thus to significantly restrain the severe state explosion problem when compiling all the rules to a single DFA.
For practical implementation, the total number of DFA states should be as few as possible, thus the data structures of these DFAs can be deployed on fast on-chip memories for rapid access. In addition, to support fast pattern update in some applications, the time cost for grouping should be as small as possible. In this study, we aimed to propose an efficient grouping method, which generates as few states as possible with as little time overhead as possible.
When compiling multiple patterns into a single DFA, the number of DFA states is usually greater than the total number of states when compiling each pattern to a separate DFA. This is mainly caused by the semantic overlaps among different rules. By quantifying the interaction values for each pair of rules, the rule grouping problem can be reduced to the maximum k-cut graph partitioning problem. Then, we propose a heuristic algorithm called the one-step greedy (OSG) algorithm to solve this NP-hard problem. What's more, a subroutine named the heuristic initialization (HI) algorithm is devised to further optimize the grouping algorithms.
We employed three practical rule sets for the experimental evaluation. Results show that the OSG algorithm outperforms the state-of-the-art grouping solutions regarding both the total number of DFA states and time cost for grouping. The HI subroutine also demonstrates its significant optimization effect on the grouping algorithms.
The DFA state explosion problem has became the most challenging issue in the regular expression matching applications. Rule grouping is a practical direction by dividing the original rule sets into multiple disjoint groups. In this paper, we investigate the current grouping solutions, and propose a compact and efficient grouping algorithm. Experiments conducted on practical rule sets demonstrate the superiority of our proposal.
Journal Article
A sequential model for the structure of health care utilization
Traditional measurement models of health care utilization are not able to represent the complex structure of health care utilization. In this qualitative study, we, therefore, developed a new model to represent the health care utilization structure. In Norway and Germany, we conducted episodic interviews, participant observation and a concurrent context analysis. Data was analyzed by thematic coding in the framework of grounded theory. Consultations do very often not only have one single reason for encounter. They are usually not independent events but form part of consultation sequences. We could find structural differences between Norway and Germany regarding the flow of information between consultations and which providers are involved in health care in what way. This leads to a sequential model, in which health care utilization is seen as sequences of consultations. Such health care utilization sequences consist of nodes which are connected by edges. Nodes represent patient-provider contacts and edges depict the flow of information. Time and the level of health care providers are dimensions in the model. These sequences can be described by different measures and aggregated on population level. Thus, the sequential model can be further used in analyzing health care utilization quantitatively, e.g., by using routine data.
Journal Article
Design of Semiconductor QCA Systems
Integrated circuits have become smaller, cheaper, and more reliable and certainly have revolutionized the world of electronics. Integrated circuits are used in almost all electronic devices and systems, many of which, such as the Internet, computers, and mobile phones, have become essential parts of modern life and have changed the way we live. Quantum-dot cellular automata (QCA) provides a revolutionary approach to computing with device-to-device interactions. The design of a QCA circuit is radically different from a conventional digital design due to its unique characteristics at both the physical level and logic level. Research on both circuit architecture and device design is required for a profound understanding of QCA nanotechnologies. This detailed reference presents practical design aspects of QCA with an emphasis on developing real-world implementations.
eBook
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
It is known that 2-state binary and 3-state unary probabilistic finite automata and 2-state unary quantum finite automata recognize uncountably many languages with cutpoints. These results have been obtained by associating each recognized language with a cutpoint and then by using the fact that there are uncountably many cutpoints. In this note, we prove the same results for fixed cutpoints: each recognized language is associated with an automaton (i.e., algorithm), and the proofs use the fact that there are uncountably many automata. For each case, we present a new construction. Comment: 12 pages, minor revisions, changing the format to \"dmtcs-episciences\" style
Journal Article
Inkdots as advice for finite automata
We examine inkdots placed on the input string as a way of providing advice tofinite automata, and establish the relations between this model and thepreviously studied models of advised finite automata. The existence of aninfinite hierarchy of classes of languages that can be recognized with the helpof increasing numbers of inkdots as advice is shown. The effects of differentforms of advice on the succinctness of the advised machines are examined. Wealso study randomly placed inkdots as advice to probabilistic finite automata,and demonstrate the superiority of this model over its deterministic version.Even very slowly growing amounts of space can become a resource of meaningfuluse if the underlying advised model is extended with access to secondarymemory, while it is famously known that such small amounts of space are notuseful for unadvised one-way Turing machines.
Journal Article
Designer’s Guide to VHDL (3rd Edition)
VHDL, the IEEE standard hardware description language for describing digital electronic systems, allows engineers to describe the structure and specify the function of a digital system as well as simulate and test it before manufacturing. In addition, designers use VHDL to synthesize a more detailed structure of the design, freeing them to concentrate on more strategic design decisions and reduce time to market. Adopted by designers around the world, the VHDL family-of-standards have recently been revised to address a range of issues, including portability across synthesis tools. This best-selling comprehensive tutorial for the language and authoritative reference on its use in hardware design at all levels, from system to gates, has been revised to reflect the new IEEE standard, VHDL-2001. The author presents the entire description language and builds a modeling methodology based on successful software engineering techniques. This second edition updates the first, retaining the author’s unique ability to teach this complex subject to a broad audience of students and practicing professionals.
eBook