Перейти к основному содержанию
Мемориальная библиотека А.П. Ершова
Toggle navigation
Издания
Журналы
Новые поступления
Вы здесь
Главная
автомат
Связанные издания:
1-Bounded TWA Cannot Be Determinized
A Cellular Automata Simulation System: Version 2.0
A Comparison of Finite and Cellular Automata
Action Transducers and Timed Automata
Ada and Timed Automata
Adaptive Automata for Context-Dependent Languages
A Four Russians Algorithm for Regular Expression Pattern Matching
A Genetic Algorithm for Grammatical Inference
A Guided Method for Testing Timed Input Output Automata
A Kleene Theorem for Recognizable Languages over Concurrency Monoids
Algebra and Coalgebra in Computer Science: Proc./5th International Conference, CALCO 2013, Warsaw, Poland, September 2013
Algebraic Foundations in Computer Science: Essays Dedicated to Symeon Bozapalidis on the Occasion of His Retirement
Algebraic Informatics: Revised Selected and Invited Papers/Second International Conference, CAI 2007. Thessaloniki, Greece, May 2007
Algorithms - ESA 2015: Proc./23rd Annual European Symposium, Patras, Greece, September 2015
Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language
Alternating Automata and Program Verification
An Algebraic Foundation for Adaptive Programming
Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic
Analyzing Fair Parametric Extended Automata
An Automata-Theoretic Approach to Branching-Time Model Checking
An Automata-Theoretic Approach to Fair Realizability and Synthesis
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
An Automata-Theoretic Approach to Linear Temporal Logic
An Automata-Theoretic Decision Procedure for Future Interval Logic
A New Concept of Refinement used for Behaviour Modeling with Automata
An Iteration Property of Lindenmayerian Power Series
A (Non-elementary) Modular Decision Procedure for LTrL
A note on minimal cover-automata for finite languages
A Numeric Object for Open Nested Transactions
An аlgorithm for computing symmetric congruence closure of finite states automata
A Parallel Programming Language for Dynamic Architecture Computers
A Pipelined Multi-core MIPS Machine: Hardware Implementation and Correctness Proof
A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems
Artificial Evolution: Proc./6th Intern. Conf., Evolution Artificielle, EA 2003, Marseille, France, October 2003
As Cheap as Possible: Linearly Priced Timed Automata
A Short Introduction to Infinite Automata
A Survey of Tree Transductions
A Taxonomy of Forgetting Automata
A Term Pattern-Match Compiler Inspired by Finite Automata Theory
A Uniform Universal CREW PRAM
Automata- and Logic-Based Pattern Languages for Tree-Structured Data
Automata, Circuits, and Hybrids: Facets of Continuous Time
Automata-Driven Efficient Subterm Unification
Automata Implementation: Proc./4th Intern. Workshop on Implementing Automata, WIA 99, Potsdam, Germany, July 1999
Automata Implementation: Proc./First Intern. Workshop on Implementing Automata, WIA 96. London, Ontario, Canada, August 1996
Automata Implementation: Proc./Third Intern. Workshop on Implementing Automata, WIA 98. Rouen, France, September 1998
Automata Implementation: Revised Papers/Second Intern. Workshop on Implementing Automata, WIA 97. London, Ontario, Canada, September 1997
Automata, Languages and Programming, Part I: 37th International Colloquium, ICALP 2010, Bordeaux, France, July 2010
Automata, Languages, and Programming: Part II: Proc./35th International Colloquium, ICALP 2008. Reykjavik, Iceland, July 2008
Automata, Languages and Programming: Part II: Proc./36th International Colloquium, ICALP 2009. Rhodes, Greece, July 2009
1
2
3
4
5
6
7
8
9
следующая ›
последняя »