| Shelfclass |
Sortkey |
Title |
| 3.D.3 |
ADÁMEK, JIŘÍ |
Automata and Algebras in Categories |
| 3.D.3 |
AHO, ALFRED V |
The Theory of Parsing, Translation, and Compiling: Volume II: Compiling: Vol. 2 |
| 3.D.3 |
AHO, ALFRED V |
The Theory of Parsing, Translation, and Compiling: Volume I: Parsing |
| 3.D.3 |
ALEKSANDER, IGOR |
Automata Theory: An Engineering Approach |
| 3.D.3 |
BERSTEL, JEAN |
Transductions and Context-Free Languages |
| 3.D.3 |
BOOK, RONALD V |
Formal Language Theory: Perspectives and Open Problems |
| 3.D.3 |
BOOTH, TAYLOR L |
Sequential Machines and Automata Theory |
| 3.D.3 |
BRAFFORT, P |
Computer Programming and Formal Systems |
| 3.D.3 |
CAIANIELLO, EDUARDO R |
Automata Theory |
| 3.D.3 |
CHARRAS, CHRISTIAN |
Handbook of Exact String Matching Algorithms |
| 3.D.3 |
CHO, SANG |
Parallel Complexity of Decision Problems in Automata Theory |
| 3.D.3 |
COOKE, STEVEN WILLIAM |
A Model of Syntax-Directed Transduction of Unrestricted Grammars Using 2PDA with Multisymbol Matching Production Rules |
| 3.D.3 |
CROCHEMORE, MAXIME |
Algorithms on Strings |
| 3.D.3 |
DASSOW, JÜRGEN |
Regulated Rewriting in Formal Language Theory |
| 3.D.3 |
DE LUCA, ALDO |
Finiteness and Regularity in Semigroups and Formal Languages |
| 3.D.3 |
DENNING, PETER J. |
Machines, Languages, and Computation |
| 3.D.3 |
DOBERKAT, ERNST-ERICH |
Stochastic Automata: Stability, Nondeterminism, and Prediction |
| 3.D.3 |
DROBOT, VLADIMIR |
Formal Languages and Automata Theory |
| 3.D.3 |
EHRIG, HARTMUT |
Universal Theory of Automata: A Categorical Approach |
| 3.D.3 |
EILENBERG, SAMUEL |
Automata, Languages, and Machines: volume A |
| 3.D.3 |
ELLIS, GLARENCE ARTHUR |
Probabilistic Languages and Automata |
| 3.D.3 |
FELLAH, ABDELAZIZ |
Alternating Finite Automata and Related Problems |
| 3.D.3 |
FINKBEINER, BERND |
Verification Algorithms Based on Alternating Automata |
| 3.D.3 |
FLOYD, ROBERT W |
The Language of Machines: An Introduction to Computability and Formal Languages |
| 3.D.3 |
FOGELMAN SOULIE, FRANCOISE |
Automata Networks in Computer Science: Theory and Applications |
| 3.D.3 |
FORD, BRYAN |
Packrat Parsing: A Practical Linear-Time Algorith with Backtracking |
| 3.D.3 |
FOX, JEROME |
Mathematical Theory of Automata: Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962 |
| 3.D.3 |
FRANK, PAUL DOUGLASS |
Bounded Nondeterminism and the Parallel Parsing of Context-Free Languages |
| 3.D.3 |
GECSEG, FERENC |
Products of Automata |
| 3.D.3 |
GILL, ARTHUR |
Introduction to the Theory of Finite-State Machines |
| 3.D.3 |
GINSBURG, SEYMOUR |
An Introduction to Mathematical Machine Theory |
| 3.D.3 |
GINSBURG, SEYMOUR |
The Mathematical Theory of Context Free Languages |
| 3.D.3 |
GINZBURG, ABRAHAM |
Algebraic Theory of Automata |
| 3.D.3 |
GUSFIELD, DAN |
Algorithms on Strings, Trees, and Sequences |
| 3.D.3 |
GUTAWITZ, HOWARD |
Cellular Automata: Theory and Experiment |
| 3.D.3 |
HABEL, ANNEGRET |
Hyperedge Replacement: Grammars and Languages |
| 3.D.3 |
HARRISON, MICHAEL A |
Introduction to Switching and Automata Theory |
| 3.D.3 |
HARTMANIS, J |
Algebraic Structure Theory of Sequential Machines |
| 3.D.3 |
HEINZ, JEFFREY |
Grammatical Inference for Computational Linguistics |
| 3.D.3 |
HEMMERLING, ARMIN |
Labyrinth Problems: Labyrinth-Searching Abilities of Automata |
| 3.D.3 |
HENNESSY, MATTHEW |
Algebraic Theory of Processes |
| 3.D.3 |
HENNIE, FREDERICK C |
Finite-State Models for Logical Machines |
| 3.D.3 |
HIGUERA, COLIN DE LA |
Grammatical Inference: Learning Automata and Grammars |
| 3.D.3 |
HOLCOMBE, W. M. L |
Algebraic Automata Theory |
| 3.D.3 |
HOPCROFT, JOHN E. |
Formal Languages and Their Relation to Automata |
| 3.D.3 |
HOPCROFT, JOHN E. |
Introduction to Automata Theory, Languages, and Computation |
| 3.D.3 |
HOPCROFT, JOHN E. |
Introduction to Automata Theory, Languages, and Computation |
| 3.D.3 |
KAIN, RICHARD Y |
Automata Theory: Machines and Languages |
| 3.D.3 |
KAMEDA, TSUNEHIKO |
On the Reduction of Non-Deterministric Automata |
| 3.D.3 |
KANDEL, ABRAHAM |
Fuzzy Switching and Automata: Theory and Applications |
| 3.D.3 |
KELLEY, DEAN |
Automata and Formal Languages: An Introduction |
| 3.D.3 |
KOBRINSKII, N. E |
Introduction to the Theory of Finite Automata |
| 3.D.3 |
KOHAVI, ZVI |
Switching and Finite Automata Theory |
| 3.D.3 |
KOHAVI, ZVI |
Theory of Machines and Computations: Proceedings of an International Symposium on the Theory of Machines and Computations, held at Technicon in Haifa, Israel, on August 16-19, 1971 |
| 3.D.3 |
KOLB, HANS-PETER |
The Mathematics of Syntactic Structure: Trees and Their Logics |
| 3.D.3 |
KOZEN, DEXTER |
Automata and Computability |
| 3.D.3 |
KRISHNAN, SHIRAM C |
Omega-Automata, Games, and Synthesis |
| 3.D.3 |
KUICH, WERNER |
Semirings, Automata, Languages |
| 3.D.3 |
KURKI-SUONIO, REINO |
A Programmer's Introduction to Computability and Formal Languages |
| 3.D.3 |
LINZ, PETER |
An Introduction to Formal Language and Automata |
| 3.D.3 |
LU, XIUYAN |
Finite State Properties of Bounded Pathwidth Graphs |
| 3.D.3 |
LYON, GORDON EDWARD |
A Syntax-Directed Least-Errors Recognizer for Context-Free Languages |
| 3.D.3 |
MALETTI, ANDREAS |
The Power of Tree Series Transducers |
| 3.D.3 |
MATZ, O |
Report on the Program AMoRE |
| 3.D.3 |
MCNAUGHTON, ROBERT |
Counter-Free Automata |
| 3.D.3 |
MILLER, CHARLOTTE L |
Context Equivalence and Context-Free Normal Forms |
| 3.D.3 |
MILLER, RAYMOND E |
Switching Theory: Volume I: Combinatorial Circuits |
| 3.D.3 |
MILLER, RAYMOND E |
Switching Theory: Volume II: Sequential Circuits and Machines |
| 3.D.3 |
MOORE, EDWARD F. |
Sequential Machines: Selected Papers |
| 3.D.3 |
MOSHELL, JACK MICHAEL |
Parallel Recognition of Formal Languages by Cellular Automata: dissertation |
| 3.D.3 |
MYCIELSKI, JAN |
Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht |
| 3.D.3 |
MYERS, EUGENE W. |
A Four-Russians Algorithm for Regular Expression Pattern Matching |
| 3.D.3 |
NIJHOLT, ANTON |
Context-Free Grammars: Covers, Normal Forms, and Parsing |
| 3.D.3 |
NIVAT, MAURICE |
Tree Automata and Languages |
| 3.D.3 |
PAUN, GHEORGHE |
Grammatical Models of Multi-Agent Systems |
| 3.D.3 |
PAUN, GHEORGHE |
New Trends in Formal Languages: Control, Cooperation, and Combinatorics |
| 3.D.3 |
PIN, J. E |
Varieties of Formal Languages |
| 3.D.3 |
RAVIKUMAR, BALASUBRAMANIAN |
Alternation and Nondeterminism in Simple Computing Devices: a thesis |
| 3.D.3 |
RAY, ROBERT E |
Parallel Parsing of Van Wijngaarden Grammars |
| 3.D.3 |
ROHDE, GARETH SCOTT |
Alternating Automata and the Temporal Logic of Ordinals |
| 3.D.3 |
ROZENBERG, GRZEGORZ |
Handbook of Formal Languages: Volume 1: Word, Language, Grammar |
| 3.D.3 |
ROZENBERG, GRZEGORZ |
Handbook of Formal Languages: Volume 2: Linear Modeling: Background and Application |
| 3.D.3 |
ROZENBERG, GRZEGORZ |
Handbook of Formal Languages: Volume 3: Beyond Words |
| 3.D.3 |
SAGAL, ANATOLE A |
Approximation of Stochastic Languages by Dynamic Syntax Systems for NLP: a dissertation |
| 3.D.3 |
SALEHI, SAEED |
A Structural Theory for Varieties of Tree Languages: an Algebraic Study of the Theory of Formal Tree Languages and Tree Automata |
| 3.D.3 |
SALOMAA, ARTO |
A Half-Century of Automata Theory: Celebration and Inspiration |
| 3.D.3 |
SALOMAA, ARTO |
Automata-Theoretic Aspects of Formal Power Series |
| 3.D.3 |
SALOMAA, ARTO |
Axiom Systems for Regular Expressions of Finite Automata |
| 3.D.3 |
SALOMAA, ARTO |
Computation and Automata |
| 3.D.3 |
SALOMAA, ARTO |
Formal Languages |
| 3.D.3 |
SALOMAA, ARTO |
Jewels of Formal Language Theory |
| 3.D.3 |
SALOMAA, ARTO |
Theory of Automata |
| 3.D.3 |
SARKAR, DILIP |
Parallel Parsing in a Multiprocessor Environment |
| 3.D.3 |
SCHMEISER, JAMES P |
Polylogarithmic Parallel Parsing |
| 3.D.3 |
SCHNEIDER, RICHARD E |
Automata Theory: Connotative Dictionary |
| 3.D.3 |
SHANNON, CLAUDE ELWOOD |
Automata Studies |
| 3.D.3 |
SIPPU, SEPPO |
Parsing Theory: Volume II: LR(k) and LL(k) Parsing: Vol. 2 |
| 3.D.3 |
SIPPU, SEPPO |
Parsing Theory: Volume I: Languages and Parsing |
| 3.D.3 |
SIPSER, MICHAEL FREDRIC |
Nondeterminism and the Size of Two-Way Finite Automata: dissertation |
| 3.D.3 |
SUDKAMP, THOMAS A |
Languages and Machines: An Introduction to the Theory of Computer Science |
| 3.D.3 |
TAMM, HELLIS |
On Minimality and Size Reduction on One-Tape and Multitape Finite Automata |
| 3.D.3 |
TOU, JULIUS T |
Applied Automata Theory |
| 3.D.3 |
VAN BUER, DARREL JAMES |
Parsers for Indexed Grammars |
| 3.D.3 |
VENTURINI, ROSSANO |
Compressed Data Structures for Strings: On Searching and Extracting Strings from Compressed Textual Data |
| 3.D.3 |
WECHLER, WOLFGANG |
The Concept of Fuzziness in Automata and Language Theory |
| 3.D.3 |
WIECZOREK, WOJCIECH |
Grammatical Inference: Algorithms, Routines and Applications |
| 3.D.3 |
YELLIN, DANIEL M |
Attribute Grammar Inversion and Source-to-source Translation |