"Complexity results for POMSET languages" - similar Books and Chapters

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Computability, Complexity, and Languages	Martin D. Davis; Elaine J. Weyuker and Werner Rheinboldt	1983	Academic Press
Advances in Algorithms, Languages, and Complexity	Ding-Zhu Du; Ker-I Ko	1997	Springer US
Computability, Complexity, and Languages (Second Edition)	Davis; Martin	1994	Morgan Kaufmann
New theoretical and computational results for regular languages.	Chia-Hsiang Chang	1991	Courant Institute of Mathematical Sciences, New York University
Problem Solving in Automata, Languages, and Complexity	Ding-Zhu Du Ph.D.,	2001	John Wiley & Sons
Problem solving in automata, languages, and complexity	Du, Dingzhu.	2001	Wiley
A Matter of Complexity: Subordination in Sign Languages	Roland Pfau; Markus Steinbach; Annika Herrmann	2016	De Gruyter Mouton
Linguistic Simplicity and Complexity: Why Do Languages Undress?	John H. McWhorter	2011	De Gruyter Mouton
Complexity Results and Practical Algorithms for Logics in Knowledge Representation [PhD Thesis]	Stephan Tobies	2001	Technische Hochschule Aachen
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science	Davis, Martin; Sigal, Ron; Weyuker, Elaine J	1994	Elsevier Science;Academic Press, Harcourt, Brace
Well-covered graphs: some new sub-classes and complexity results	Ramesh S. Sankaranarayana	1994
Polystochastic Models for Complexity	Octavian Iordache	2010	Springer Berlin Heidelberg
Decision Economics: Complexity of Decisions and Decisions for Complexity	Edgardo Bucciarelli; Shu-Heng Chen; Juan Manuel Corchado	1st ed. 2020	Springer International Publishing
Environmental Protection: Regulating for Results: Regulating For Results	Kenneth Chilton; Melinda Warren	1991	Routledge
Languages for adults.	Michael Hay	1973	Longman
Languages for Automation	Shi-Kuo Chang	1985	Springer US
Managing for Results	Peter F. Drucker	1964	Butterworth-Heinemann
Managing for results.	Elearn	2009.	ELEARN,
Reading for Results	Laraine E. Flemming	2010	Wadsworth Publishing
Investing for results	Mansfield Mills	1976	M. Mills
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
Complexity results for POMSET languages	Joan Feigenbaum; Jeremy A. Kahn; Carsten Lund	Computer Aided Verification: 3rd International Workshop, CAV ' 91, Aalborg, Denmark, July 1-4, 1991. Proceedings	Kim G. Larsen; Arne Skou	1992	Springer Berlin Heidelberg
Pomset Logic and variants in natural languages	Irene Schena	Logical Aspects of Computational Linguistics: First International Conference, LACL ' 96, Nancy, France, September 23-25, 1996. Selected Papers	Christian Retore	1997	Springer Berlin Heidelberg
Pomset Languages of Finite Step Transition Systems	Jean Fanchon; Rémi Morin	Applications and Theory of Petri Nets: 30th International Conference, PETRI NETS 2009, Paris, France, June 22-26, 2009, Proceedings	Giuliana Franceschinis; Karsten Wolf	2009	Springer Berlin Heidelberg
Complexity Results on Balanced Context-Free Languages	Akihiko Tozawa; Yasuhiko Minamide	Foundations of Software Science and Computational Structures: 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings	Helmut Seidl	2007	Springer Berlin Heidelberg
Pomset Logic	Christian Retoré	Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics	Claudia Casadio; Philip J. Scott	1st ed. 2021	Springer International Publishing
Complexity Results	Stephen T. Hedetniemi; Alice A. McRae; Dolores A. Parks	Domination in Graphs Advanced Topics: Volume 2: Advanced Topics	Teresa W. Haynes; Stephen T. Hedetniemi; Peter J. Slater	1998	Routledge
Complexity Results		External Labeling: Fundamental Concepts and Algorithmic Techniques	Michael A Bekos, Benjamin Niedermann, Martin Nöllenburg	2021	Morgan & Claypool
Complexity Results		Heterogeneous Agent Systems	V S. Subrahmanian; Piero Andrea Bonatti; Juergen Dix; Thomas Robert Eiter; Sarit Kraus; Fatma Ozcan; Robert B. Ross	2000	MIT Press
Complexity Results for Confluence Problems	Markus Lohrey	Mathematical Foundations of Computer Science 1999: 24th International Symposium, MFCS' 99 Szklarska Poreba, Poland, September 6-10, 1999 Proceedings	Miroslaw Kutylowski; Leszek Pacholski; Tomasz Wierzbicki	1999	Springer Berlin Heidelberg
Complexity Results for Extended Planning	Tom Bylander	Artificial Intelligence Planning Systems	James Hendler	1992	Morgan Kaufmann
Complexity Results for Elementary Hornets	Michael Köhler-Bußmeier; Frank Heitmann	Application and Theory of Petri Nets and Concurrency: 34th International Conference, PETRI NETS 2013, Milan, Italy, June 24-28, 2013, Proceedings	Jose-Manuel Colom; Jörg Desel	2013	Springer Berlin Heidelberg
Waiting for Trains: Complexity Results	Bjoern Tauer; Dennis Fischer; Janosch Fuchs; Laura Vargas Koch; Stephan Zieger	Algorithms and Discrete Applied Mathematics: 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings	Manoj Changat; Sandip Das	1st ed. 2020	Springer International Publishing
Complexity results for bandwidth minimization		Selected papers on analysis of algorithms	Donald Knuth	2000	Center for the Study of Language and Information, Leland Stanford Junior University
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata	Taylor J. Smith; Kai Salomaa	Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings	Galina Jirásková; Giovanni Pighizzini	1st ed. 2020	Springer International Publishing
Pomset- und Stepsprachen	Lutz Priese; Harro Wimmel	Theoretische Informatik: Petri-Netze	Lutz Priese; Harro Wimmel	2003	Springer Berlin Heidelberg
Pomset- und Stepsprachen		Petri-Netze	Lutz Priese; Harro Wimmel	2. Aufl. 2008	Springer Berlin Heidelberg
Learning Pomset Automata	Gerco van Heerdt; Tobias Kappé; Jurriaan Rot; Alexandra Silva	Foundations of Software Science and Computation Structures: 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings	Stefan Kiefer; Christine Tasson	1st ed. 2021	Springer International Publishing
Computational Complexity Results	Roland Hausser	Computation of Language: An Essay on Syntax, Semantics and Pragmatics in Natural Man-Machine Communication	Roland Hausser	1989	Springer Berlin Heidelberg
11: Complexity Results		Heterogeneous Agent Systems	V. S. Subrahmanian; Piero Andrea Bonatti; Jürgen Dix; Thomas Robert Eiter; Sarit Kraus; Fatma Ozcan; Robert B. Ross	2000	MIT Press,
1252 Complexity results		Boolean Functions: Theory, Algorithms, and Applications.	Yves Crama, Peter L. Hammer	2011	Cambridge University Press
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries