Перейти к основному содержанию
Мемориальная библиотека А.П. Ершова
Toggle navigation
Издания
Журналы
Новые поступления
Вы здесь
Главная
регулярный
Связанные издания:
A Domain-Specific Language for Regular Sets of Strings and Trees
AI Approaches to the Complexity of Legal Systems: Revised Selected Papers/AICOL 2013 International Workshops, AICOL-IV@IVR, Belo Horizonte, Brazil, Jule 2013 and AICOL-V@SINTELNET-JURIX, Bologna, Italy, December 2013
A Logical Approach to Decidability of Hierarchies of Regular Star-free Languages
An Optimal Algorithm for Purging Regular Schemas
An Optimal Algorithm for Purging Regular Schemes
Automata, Languages and Programming: Part II: Proc./36th International Colloquium, ICALP 2009. Rhodes, Greece, July 2009
Classifying Regular Languages by Their Syntactic Algebras
Commutative Regular Languages
Cooperating/Distributed Grammar Systems with Regular Components
Declarative Peephole Optimization Using String Pattern Matching
Descriptional Complexity of Formal Systems: Proc./15th International Workshop, DCFS 2013, London,ON,Canada, July 2013
Developments in Language Theory: Proc./18th International Conference, DLT 2014, Ekaterinburg, Russia, August 2014
Families of automata characterizing context-sensitive languages
Implementation and Application of Automata: Proc./21st International Conference, CIAA 2016, Seoul, South Korea, July 2016
Implementation and Application of Automata: Proc./23rd International Conference, CIAA 2018, Charlottetown,PE,Canada, July 2018
Implementation and Application of Automata: Revised Selected Papers/9th International Conference, CIAA 2004. Kingston, Canada, July 2004
Information Processing in Cells and Tissues: Proc./10th International Conference, IPCAT 2015, San Diego,CA,USA, September 2015
Language and Automata Theory and Applications: Proc./6th International Conference, LATA 2012, A Coruna, Spain, March 2012
Mapping of Time Cause-Effect Structures into Time Regular Petri Nets
On Recognizable Timed Languages
On Scattered Syntactic Monoids
On Some Open Problems Concerning the Complexity of Cellular Arrays
Parcella 88
Parcella 90
Prefix-free languages as omega-generators
Progress in Artificial Intelligence: Proc./16th Portuguese Conferenceon AI, EPIA 2013, Angra do Heroismo, Azores, Portugal, September 2013
Rational Transductions and Complexity of Counting problems
Recursive Definitions Revisited
Regular Languages and a Class of Logic Programs
Regular Languages, Sizes on Syntactic Monoids,Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other
Regular Tree Languages without Unary Symbols Are Star-Free
Scanning Regular Languages by Dual Finite Automata
Second-Order Logic over Strings: Regular and Non-regular Fragments
Some Reducibilities on Regular Sets
Synchronized Regular Expressions
The Emptiness Problem for Intersections of Regular Languages
The Hausdorff-Kuratowski hierarchy of -reggular languages and a hierarchy of Muller automata
The L(2,1)-Labeling Problem on Oriented Regular Grids
Theoretical Aspects of Computing - ICTAC 2009: Proc./6th International Colloquium. Kuala Lumpur, Malaysia, August 2009
Trends in Functional Programming: Revised Selected Papers/13th International Symposium, TFP 2012, St.Andrews, UK, June 2012
Undecidable Problems About Timed Automata
Well Quasi-Orders and Regular Languages
Алгебра регулярных сетей Петри
Алгебра связных графов и проектирование топологии компьютерных сетей
Алгоритм построения логических правил при разметке текстов
Влияние регулярных системных прерываний на производительность параллельных трафаретных вычислений
Вопросы полноты для регулярных отображений
Композиционное построение детерминированного конечного автомата по множеству регулярных выражений
Моделирование причинно-следственной структуры Чайя в терминах регулярных сетей Петри
Некоторые оценки конечноавтоматной сложности обобщённых регулярных выражений и порождающих схем
1
2
следующая ›
последняя »