To see the other types of publications on this topic, follow the link: Finite State Theory.

Books on the topic 'Finite State Theory'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 books for your research on the topic 'Finite State Theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse books on a wide variety of disciplines and organise your bibliography correctly.

1

Timothy, Kam, ed. Synthesis of finite state machines: Functional optimization. Boston, Mass: Kluwer Acadmic Publishers, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Stochastic games with finite state and action spaces. [Amsterdam, the Netherlands]: Centrum voor Wiskunde en Informatica, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kam, Timothy. Synthesis of Finite State Machines: Functional Optimization. Boston, MA: Springer US, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ferdinand, Wagner, ed. Modeling software with finite state machines: A practical approach. Boca Raton, FL: Taylor & Francis, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Villa, Tiziano. Synthesis of Finite State Machines: Logic Optimization. Boston, MA: Springer US, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

1953-, Villa Tiziano, ed. Synthesis of finite state machines: Logic optimization. Boston: Kluwer Academic, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Czerwinski, Robert. Finite State Machine Logic Synthesis for Complex Programmable Logic Devices. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

C, Solomon R., ed. Representation theory of finite groups: Proceedings of a special research quarter at the Ohio State University, spring, 1995. Berlin: Walter de Gruyter, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Steven, Nowick, ed. Sequential optimization of asynchronous and synchronous finite-state machines: Algorithms and tools. Boston: Kluwer Academic Publishers, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fuhrer, Robert M. Sequential optimization of asynchronous and synchronous finite-state machines: Algorithms and tools. Boston: Kluwer Academic Publishers, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
11

1954-, Arasu K. T., ed. Groups, difference sets, and the monster: Proceedings of a special research quarter at the Ohio State University, spring 1993. Berlin: Walter de Gruyter, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
12

Buhmann, Stefan Yoshi. Dispersion Forces II: Many-Body Effects, Excited Atoms, Finite Temperature and Quantum Friction. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
13

Yee, H. C. Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. [Washington, D.C: National Aeronautics and Space Administration, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
14

Yee, H. C. Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. [Washington, D.C: National Aeronautics and Space Administration, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
15

K, Sweby P., and Ames Research Center, eds. Nonlinear dynamics & numerical uncertainties in CFD. Moffet Field, Calif: Ames Research Center, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
16

K, Sweby P., and Ames Research Center, eds. Nonlinear dynamics & numerical uncertainties in CFD. Moffet Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
17

K, Sweby P., and Ames Research Center, eds. Nonlinear dynamics & numerical uncertainties in CFD. Moffet Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
18

Southeastern Lie Theory Workshop on Combinatorial Lie Theory and Applications (2009 : North Carolina State University), Southeastern Lie Theory Conference on Homological Methods in Representation Theory (2010 : University of Georgia), and Southeastern Lie Theory Workshop: Finite and Algebraic Groups (2011 : University of Virginia), eds. Recent developments in Lie algebras, groups, and representation theory: 2009-2011 Southeastern Lie Theory Workshop series : Combinatorial Lie Theory and Applications, October 9-11, 2009, North Carolina State University : Homological Methods in Representation Theory, May 22-24, 2010, University of Georgia : Finite and Algebraic Groups, June 1-4, 2011, University of Virginia. Providence, Rhode Island: American Mathematical Society, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
19

Lahyane, Mustapha. Algbra for secure and reliable communication modeling: CIMPA Research School and Conference Algebra for Secure and Reliable Communication Modeling, October 1-13, 2012, Morelia, State of Michoaczn, Mexico. Edited by Martínez-Moro Edgar editor. Providence, Rhode Island: American Mathematical Society, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
20

Session, Ring Theory. Ring theory and its applications: Ring Theory Session in honor of T.Y. Lam on his 70th birthday at the 31st Ohio State-Denison Mathematics Conference, May 25-27, 2012, The Ohio State University, Columbus, OH. Edited by Lam, T. Y. (Tsit-Yuen), 1942- honouree, Huynh, Dinh Van, 1947- editor of compilation, and Ohio State-Denison Mathematics Conference. Providence, Rhode Island: American Mathematical Society, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
21

Lie algebras, lie superalgebras, vertex algebras, and related topics: Southeastern Lie Theory Workshop Series 2012-2014 : Categorification of Quantum Groups and Representation Theory, April 21-22, 2012, North Carolina State University : Lie Algebras, Vertex Algebras, Integrable Systems and Applications, December 16-18, 2012, College of Charleston : Noncommutative Algebraic Geometry and Representation Theory, May 10-12, 2013, Louisiana State Vniversity : Representation Theory of Lie Algebras and Lie Superalgebras, May 16-17, 2014, University of Georgia. Providence, Rhode Island: American Mathematical Society, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
22

Topology and geometry in dimension three: Triangulations, invariants, and geometric structures : conference in honor of William Jaco's 70th birthday, June 4-6, 2010, Oklahoma State University, Stillwater, OK. Providence, R.I: American Mathematical Society, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
23

Wagner, Ferdinand, Ruedi Schmuki, Peter Wolstenholme, and Thomas Wagner. Modeling Software with Finite State Machines. Taylor & Francis Group, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
24

Villa, Tiziano, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli, and Timothy Kam. Synthesis of Finite State Machines:: Functional Optimization. Springer, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
25

Pedroni, Volnei A. Finite State Machines in Hardware: Theory and Design. MIT Press, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
26

Pedroni, Volnei A. Finite State Machines in Hardware: Theory and Design. MIT Press, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
27

Pedroni, Volnei A. Finite State Machines in Hardware: Theory and Design. MIT Press, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
28

Handbook Of Finite State Based Models And Applications. CRC Press, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
29

Wagner, Ferdinand, Ruedi Schmuki, Peter Wolstenholme, and Thomas Wagner. Modeling Software with Finite State Machines: A Practical Approach. Auerbach Publishers, Incorporated, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
30

Wagner, Ferdinand, Ruedi Schmuki, Peter Wolstenholme, and Thomas Wagner. Modeling Software with Finite State Machines: A Practical Approach. AUERBACH, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
31

Bragg, Jonathan. Detection of neo-Riemannian cycles: A finite state approach. 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
32

Wagner, Ferdinand. Modeling Software with Finite State Machines: A Practical Approach. Taylor & Francis Group, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
33

Finite State Machines In Hardware Theory And Design With Vhdl And Systemverilog. MIT Press Ltd, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
34

Reese, Robert. Finite State Machine-datapath Design, Optimization, and Implementation (Synthesis Lectures on Digital Circuits and Systems). Morgan & Claypool Publishers, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
35

Kania, Dariusz, and Robert Czerwinski. Finite State Machine Logic Synthesis for Complex Programmable Logic Devices. Springer, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
36

Villa, Tiziano, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli, and Timothy Kam. Synthesis of Finite State Machines:: Logic Optimization. Springer, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
37

Synthesis of Finite State Machines: Logic Optimization. Springer, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
38

Kania, Dariusz, and Robert Czerwinski. Finite State Machine Logic Synthesis for Complex Programmable Logic Devices. Springer, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
39

Kania, Dariusz, and Robert Czerwinski. Finite State Machine Logic Synthesis for Complex Programmable Logic Devices. Springer, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
40

Fuhrer, Robert M., and Steven M. Nowick. Sequential Optimization of Asynchronous and Synchronous Finite-State Machines: Algorithms and Tools. Springer, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
41

Arasu, K. T. Groups, Difference Sets, and the Monster: Proceedings of a Special Research Quarter at the Ohio State University, Spring 1993 (Ohio State University Mathematical Research Institute Publications, 4). Walter de Gruyter, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
42

Solomon, Ronald. Representation Theory of Finite Groups: Proceedings of a Special Research Quarter at the Ohio State University, Spring 1995. de Gruyter GmbH, Walter, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
43

Dillon, J. F., K. Harada, S. Sehgal, K. T. Arasu, and R. Solomon. Groups, Difference Sets, and the Monster: Proceedings of a Special Research Quarter at the Ohio State University, Spring 1993. de Gruyter GmbH, Walter, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
44

Solomon, Ronald. Representation Theory of Finite Groups: Proceedings of a Special Research Quarter at the Ohio State University, Spring 1995 (Ohio State University Mathematical Research Institute Publications, 6). Walter de Gruyter, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
45

Shornikov, Yury V. Theory of Programming Languages: Design and Implementation. Novosibirsk State Technical University, 2022. http://dx.doi.org/10.17212/978-5-7782-4817-5.

Full text
Abstract:
The textbook has been prepared in accordance with the State educational Standard in the fields of "Computer Science and Computer Engineering" (09.03.01), "Applied Computer Science" (09.03.03) for the cycle of disciplines of information specialties. The basis of the textbook was the material of lectures delivered by the author to students of the relevant specialties at the Novosibirsk State Technical University and the Kazakh-British Technical University in the courses "Theory of Formal Languages and Compilers", "System Software", and "Linguistic Support". The textbook discusses the theory of generating grammars, finite automata and regular expressions. All theoretical mechanisms of analysis and synthesis of language constructions are strictly formalized and constitute the theoretical foundations of the programming language design. The implementation of programming languages is represented by the development of language processors. The transition from formal languages to language processors is carried out through constructive analysis methods with strict modeling algorithms that can be implemented in high-level languages or with the help of modern programming automation tools. The manual discusses ANTLR and FLEX & BIZON tools for automating parser and lexer programming. Despite the educational orientation, the manual can be useful to anyone who is engaged in the design and implementation of new languages, language processors and finite-automaton recognizers.
APA, Harvard, Vancouver, ISO, and other styles
46

Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. [Washington, D.C: National Aeronautics and Space Administration, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
47

Karttunen, Lauri. Finite-State Technology. Edited by Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0018.

Full text
Abstract:
The article introduces the basic concepts of finite-state language processing: regular languages and relations, finite-state automata, and regular expressions. Many basic steps in language processing, ranging from tokenization, to phonological and morphological analysis, disambiguation, spelling correction, and shallow parsing, can be performed efficiently by means of finite-state transducers. The article discusses examples of finite-state languages and relations. Finite-state networks can represent only a subset of all possible languages and relations; that is, only some languages are finite-state languages. Furthermore, this article introduces two types of complex regular expressions that have many linguistic applications, restriction and replacement. Finally, the article discusses the properties of finite-state automata. The three important properties of networks are: that they are epsilon free, deterministic, and minimal. If a network encodes a regular language and if it is epsilon free, deterministic, and minimal, the network is guaranteed to be the best encoding for that language.
APA, Harvard, Vancouver, ISO, and other styles
48

Segal, D., P. Kral, and M. Shapiro. Theory, experiment and applications of tubular image states. Edited by A. V. Narlikar and Y. Y. Fu. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780199533046.013.22.

Full text
Abstract:
This article presents a detailed theoretical description of tubular image states (TIS) around different tube geometries, along with their applications. It begins with a discussion of the theoretical background for the existence of TIS in conjunction with infinitely long homogeneous carbon nanotubes, finite and inhomogeneous nanotubes, and nanotubes arrays. It then considers the lifetimes and stability of TIS, along with the states’ tunability by external fields and the onset of chaos in TIS. In particular, it examines how TIS can be manipulated by means of electric and magnetic fields. It also describes nano-Paul traps of single electrons based on TIS and concludes with an assessment of recent experiments on TIS.
APA, Harvard, Vancouver, ISO, and other styles
49

Eckle, Hans-Peter. Models of Quantum Matter. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780199678839.001.0001.

Full text
Abstract:
This book focuses on the theory of quantum matter, strongly interacting systems of quantum many–particle physics, particularly on their study using exactly solvable and quantum integrable models with Bethe ansatz methods. Part 1 explores the fundamental methods of statistical physics and quantum many–particle physics required for an understanding of quantum matter. It also presents a selection of the most important model systems to describe quantum matter ranging from the Hubbard model of condensed matter physics to the Rabi model of quantum optics. The remaining five parts of the book examines appropriate special cases of these models with respect to their exact solutions using Bethe ansatz methods for the ground state, finite–size, and finite temperature properties. They also demonstrate the quantum integrability of an exemplary model, the Heisenberg quantum spin chain, within the framework of the quantum inverse scattering method and through the algebraic Bethe ansatz. Further models, whose Bethe ansatz solutions are derived and examined, include the Bose and Fermi gases in one dimension, the one–dimensional Hubbard model, the Kondo model, and the quantum Tavis–Cummings model, the latter a model descendent from the Rabi model.
APA, Harvard, Vancouver, ISO, and other styles
50

Arthur, Richard T. W. Continuance through Time. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198812869.003.0008.

Full text
Abstract:
This final chapter concerns questions of the continuity of existence through time. There are various difficulties: if substances produce their own states, how is this compatible with divine concurrence? And if creation is continuous and yet their states are instantaneous, how does Leibniz avoid reducing monadic duration to a discontinuous aggregate of states? It is argued that a solution to these profound difficulties requires a recognition that monadic states are actually discrete and of finite duration, each containing other smaller states to infinity; yet they are physically continuous, in that each state issues by degrees from the preceding one, and there is no assignable instant at which change does not occur. It is also explained how momentaneous states and forces are to be understood in terms of Leibniz’s foundation for the differential calculus.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography