| Publication | Date of Publication | Type |
|---|
On properties of languages accepted by deterministic pushdown automata with translucent input letters
| 2025-01-20 | Paper |
Reversible Computations of One-Way Counter Automata
RAIRO - Theoretical Informatics and Applications | 2024-04-16 | Paper |
Reversible Two-Party Computations
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
On the power of pushing or stationary moves for input-driven pushdown automata
Theoretical Computer Science | 2024-04-04 | Paper |
Sweeping input-driven pushdown automata
Implementation and Application of Automata | 2024-02-28 | Paper |
Iterative arrays with finite inter-cell communication
Natural Computing | 2024-02-16 | Paper |
Iterative arrays with self-verifying communication cell
Natural Computing | 2024-02-16 | Paper |
Shrinking one-way cellular automata
Natural Computing | 2024-02-09 | Paper |
Reversible computations of one-way counter automata
| 2024-02-06 | Paper |
25 editions of DCFS: origins and directions
| 2024-02-06 | Paper |
Revisiting the cutting of the firing squad synchronization
Natural Computing | 2023-11-30 | Paper |
scientific article; zbMATH DE number 7770052 (Why is no real title available?)
| 2023-11-23 | Paper |
Tree-walking-storage automata
Developments in Language Theory | 2023-11-16 | Paper |
One-dimensional pattern generation by cellular automata
Natural Computing | 2023-09-01 | Paper |
Complexity of exclusive nondeterministic finite automata
Descriptional Complexity of Formal Systems | 2023-08-17 | Paper |
Input-Driven Double-Head Pushdown Automata
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Reversible Top-Down Syntax Analysis
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Iterated uniform finite-state transducers on unary languages
Theoretical Computer Science | 2023-08-01 | Paper |
Self-verifying Cellular Automata
Developments in Language Theory | 2023-06-30 | Paper |
Syntax checking either way
Theoretical Computer Science | 2023-06-21 | Paper |
State complexity of finite partial languages
Theoretical Computer Science | 2023-06-21 | Paper |
State complexity of finite partial languages
| 2023-01-18 | Paper |
Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
| 2022-12-16 | Paper |
Optimizing reversible programs
| 2022-11-11 | Paper |
State complexity of partial word finite automata
| 2022-11-09 | Paper |
scientific article; zbMATH DE number 7584596 (Why is no real title available?)
| 2022-09-14 | Paper |
Syntax checking either way
| 2022-08-16 | Paper |
On the power of pushing or stationary moves for input-driven pushdown automata
| 2022-08-16 | Paper |
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
Fundamenta Informaticae | 2022-07-14 | Paper |
String assembling systems: comparison to sticker systems and decidability
| 2022-07-06 | Paper |
Cellular Automata and Language Theory
Cellular Automata | 2022-04-28 | Paper |
Finite automata with undirected state graphs
Acta Informatica | 2022-04-01 | Paper |
Reversible top-down syntax analysis
| 2022-03-25 | Paper |
One-dimensional pattern generation by cellular automata
| 2022-03-24 | Paper |
Iterated uniform finite-state transducers on unary languages
| 2022-03-24 | Paper |
Boolean kernels of context-free languages
| 2022-03-22 | Paper |
Descriptional complexity of iterated uniform finite-state transducers
Information and Computation | 2022-03-14 | Paper |
Descriptional complexity of regular languages
| 2022-02-04 | Paper |
Digging input-driven pushdown automata
RAIRO - Theoretical Informatics and Applications | 2022-01-12 | Paper |
Input-driven double-head pushdown automata
| 2021-12-13 | Paper |
On the descriptional complexity of operations on semilinear sets
| 2021-12-13 | Paper |
Reversible pushdown transducers
Information and Computation | 2021-11-25 | Paper |
Self-verifying pushdown and queue automata
Fundamenta Informaticae | 2021-11-15 | Paper |
Two-Sided Strictly Locally Testable Languages
Fundamenta Informaticae | 2021-11-15 | Paper |
Compiling Janus to RSSA
Reversible Computation | 2021-11-03 | Paper |
String generation by cellular automata
Complex Systems | 2021-09-08 | Paper |
Self-verifying cellular automata
| 2021-08-25 | Paper |
Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion
| 2021-07-14 | Paper |
Cellular string generators
| 2021-07-08 | Paper |
Measuring communication in parallel communicating finite automata
| 2021-06-22 | Paper |
Input-driven multi-counter automata
Theoretical Computer Science | 2021-06-03 | Paper |
Automata that may change their mind
| 2021-05-12 | Paper |
On two-sided locally testable languages
| 2021-05-12 | Paper |
Transductions computed by one-dimensional cellular automata
| 2021-04-27 | Paper |
Boosting reversible pushdown and queue machines by preprocessing
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
The magic number problem for subregular language families
| 2021-02-24 | Paper |
Bounded languages meet cellular automata with sparse communication
| 2021-01-26 | Paper |
On the number of membranes in unary P systems
| 2021-01-26 | Paper |
scientific article; zbMATH DE number 7301306 (Why is no real title available?)
| 2021-01-26 | Paper |
Multi-head finite automata: characterizations, concepts and open problems
| 2021-01-20 | Paper |
Multi-stranded string assembling systems
| 2020-10-22 | Paper |
Kernels of sub-classes of context-free languages
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Finite automata with undirected state graphs
Descriptional Complexity of Formal Systems | 2020-06-30 | Paper |
Cellular automata: descriptional complexity and decidability
Reversibility and Universality | 2020-05-28 | Paper |
Queue Automata: Foundations and Developments
Reversibility and Universality | 2020-05-28 | Paper |
Non-recursive trade-offs are ``almost everywhere
| 2020-05-12 | Paper |
Descriptional complexity of iterated uniform finite-state transducers
Descriptional Complexity of Formal Systems | 2020-05-12 | Paper |
Input-driven multi-counter automata
Implementation and Application of Automata | 2020-05-06 | Paper |
Iterative arrays with set storage
| 2020-03-12 | Paper |
One-time nondeterministic computations
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
Iterative arrays with finite inter-cell communication
| 2019-12-05 | Paper |
Iterative arrays with self-verifying communication cell
| 2019-12-05 | Paper |
Transducing reversibly with finite state machines
Theoretical Computer Science | 2019-08-20 | Paper |
Expressive capacity of subregular expressions
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Diving into the queue
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Recent trends in descriptional complexity of formal languages
| 2019-07-03 | Paper |
Operational state complexity and decidability of jumping finite automata
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Reversible pushdown transducers
Developments in Language Theory | 2018-11-22 | Paper |
Boosting pushdown and queue machines by preprocessing
| 2018-11-07 | Paper |
Parametrizing string assembling systems
| 2018-11-07 | Paper |
Structure and Complexity of Some Subregular Language Families
The Role of Theory in Computer Science | 2018-09-20 | Paper |
Cutting the Firing Squad Synchronization
Lecture Notes in Computer Science | 2018-07-06 | Paper |
Minimal reversible deterministic finite automata
International Journal of Foundations of Computer Science | 2018-05-15 | Paper |
Descriptional complexity of bounded regular languages
| 2018-03-29 | Paper |
Descriptional complexity of limited automata
Information and Computation | 2018-03-21 | Paper |
Reversible nondeterministic finite automata
| 2018-03-16 | Paper |
Fast one-way cellular automata with reversible Mealy cells
| 2018-03-08 | Paper |
Deterministic stack transducers
International Journal of Foundations of Computer Science | 2018-02-22 | Paper |
The degree of irreversibility in deterministic finite automata
International Journal of Foundations of Computer Science | 2018-02-22 | Paper |
Reversible limited automata
Fundamenta Informaticae | 2018-01-19 | Paper |
Tinput-driven pushdown, counter, and stack automata
Fundamenta Informaticae | 2018-01-19 | Paper |
Reversible queue automata
Fundamenta Informaticae | 2017-11-09 | Paper |
Operational state complexity and decidability of jumping finite automata
| 2017-10-13 | Paper |
One-time nondeterministic computations
| 2017-08-31 | Paper |
Transducing reversibly with finite state machines
Implementation and Application of Automata | 2017-08-22 | Paper |
Concatenation-free languages
Theoretical Computer Science | 2017-06-19 | Paper |
The chop of languages
Theoretical Computer Science | 2017-06-15 | Paper |
One-way reversible multi-head finite automata
Theoretical Computer Science | 2017-06-15 | Paper |
When input-driven pushdown automata meet reversiblity
RAIRO - Theoretical Informatics and Applications | 2017-03-24 | Paper |
Self-assembling pushdown automata
| 2016-12-16 | Paper |
scientific article; zbMATH DE number 6665209 (Why is no real title available?)
| 2016-12-16 | Paper |
Descriptional complexity of bounded regular languages
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
The degree of irreversibility in deterministic finite automata
Implementation and Application of Automata | 2016-11-09 | Paper |
Deterministic stack transducers
Implementation and Application of Automata | 2016-11-09 | Paper |
A hierarchy of fast reversible Turing machines
Reversible Computation | 2016-09-30 | Paper |
One-way cellular automata, bounded languages, and minimal communication
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
Hairpin finite automata
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
On measuring non-recursive trade-offs
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
Boosting reversible pushdown machines by preprocessing
Reversible Computation | 2016-08-10 | Paper |
The chop of languages
| 2016-07-26 | Paper |
Set automata
International Journal of Foundations of Computer Science | 2016-06-23 | Paper |
On one-way one-bit \(O\) (one)-message cellular automata
Electronic Notes in Theoretical Computer Science | 2016-06-09 | Paper |
Deterministic one-way Turing machines with sublinear space
Fundamenta Informaticae | 2016-05-11 | Paper |
Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
Input-Driven Queue Automata with Internal Transductions
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Reversible shrinking two-pushdown automata
Language and Automata Theory and Applications | 2016-04-13 | Paper |
One-way reversible multi-head finite automata
Reversible Computation | 2015-11-30 | Paper |
Minimal reversible deterministic finite automata
Developments in Language Theory | 2015-11-10 | Paper |
The size of one-way cellular automata
| 2015-11-02 | Paper |
Expressive capacity of concatenation freeness
Implementation and Application of Automata | 2015-09-23 | Paper |
Reversible and irreversible computations of deterministic finite-state devices
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Reversible limited automata
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Tinput-Driven Pushdown Automata
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Aspects of reversibility for classical automata
Computing with New Resources | 2015-09-08 | Paper |
On simulation cost of unary limited automata
Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
Shrinking One-Way Cellular Automata
Cellular Automata and Discrete Complex Systems | 2015-08-07 | Paper |
Complexity of one-way cellular automata
Cellular Automata and Discrete Complex Systems | 2015-08-04 | Paper |
Real-time reversible one-way cellular automata
Cellular Automata and Discrete Complex Systems | 2015-08-04 | Paper |
Deterministic input-driven queue automata: finite turns, decidability, and closure properties
Theoretical Computer Science | 2015-05-18 | Paper |
Stateless one-way multi-head finite automata with pebbles
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Complexity of operation problems
Language, Life, Limits | 2015-02-25 | Paper |
Simulations of unary one-way multi-head finite automata
International Journal of Foundations of Computer Science | 2015-02-09 | Paper |
Parameterized Prefix Distance between Regular Languages
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Head and state hierarchies for unary multi-head finite automata
Acta Informatica | 2014-12-03 | Paper |
Deterministic set automata
Developments in Language Theory | 2014-10-14 | Paper |
Measuring communication in automata systems (invited paper)
Developments in Language Theory | 2014-10-14 | Paper |
Degrees of reversibility for DFA and DPDA
Reversible Computation | 2014-09-02 | Paper |
Bidirectional string assembling systems
RAIRO. Theoretical Informatics and Applications | 2014-08-22 | Paper |
Regularity and size of set automata
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Oblivious two-way finite automata: decidability and complexity
Information and Computation | 2014-07-18 | Paper |
\(\omega \)-rational languages: high complexity classes vs. Borel hierarchy
Language and Automata Theory and Applications | 2014-03-31 | Paper |
On the descriptional complexity of the window size for deleting restarting automata
International Journal of Foundations of Computer Science | 2014-03-10 | Paper |
One-dimensional cellular automaton transducers
| 2014-02-11 | Paper |
The size impact of little iterative array resources
| 2014-02-05 | Paper |
Non-deterministic cellular automata and languages
International Journal of General Systems | 2014-01-06 | Paper |
Time-Symmetric Machines
Reversible Computation | 2013-12-17 | Paper |
Size of unary one-way multi-head finite automata
Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
Input-driven queue automata: finite turns, decidability, and closure properties
Implementation and Application of Automata | 2013-08-07 | Paper |
One-Way Multi-Head Finite Automata with Pebbles But No States
Developments in Language Theory | 2013-06-28 | Paper |
String assembling systems
RAIRO - Theoretical Informatics and Applications | 2012-11-22 | Paper |
Reversible pushdown automata
Journal of Computer and System Sciences | 2012-11-06 | Paper |
States and heads do count for unary multi-head finite automata
Developments in Language Theory | 2012-11-02 | Paper |
On CD-systems of stateless deterministic two-phase RR(1)-automata
Lecture Notes in Computer Science | 2012-11-01 | Paper |
Input-driven stack automata
Lecture Notes in Computer Science | 2012-09-21 | Paper |
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata
Implementation and Application of Automata | 2012-09-20 | Paper |
On the computational capacity of parallel communicating finite automata
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
The magic number problem for subregular language families
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Undecidability and hierarchy results for parallel communicating finite automata
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
The complexity of regular(-like) expressions
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
Nondeterministic state complexity of star-free languages
Theoretical Computer Science | 2012-08-09 | Paper |
Oblivious two-way finite automata: decidability and complexity
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Descriptional complexity -- an introductory survey
| 2011-12-01 | Paper |
Computational complexity of NURIKABE
Fundamenta Informaticae | 2011-11-22 | Paper |
Nature-based problems in cellular automata
Models of Computation in Context | 2011-09-09 | Paper |
Gaining Power by Input Operations: Finite Automata and Beyond
Implementation and Application of Automata | 2011-07-29 | Paper |
Nodes connected by path languages
Developments in Language Theory | 2011-07-29 | Paper |
Nondeterministic state complexity of star-free languages
Implementation and Application of Automata | 2011-07-29 | Paper |
Descriptional and computational complexity of finite automata -- a survey
Information and Computation | 2011-07-27 | Paper |
Decidability of operation problems for T0L languages and subclasses
Information and Computation | 2011-07-27 | Paper |
Cellular automata with limited inter-cell bandwidth
Theoretical Computer Science | 2011-07-18 | Paper |
String transformation for \(n\)-dimensional image compression
SOFSEM 2002: Theory and Practice of Informatics | 2011-04-01 | Paper |
Two-party Watson-Crick computations
Implementation and Application of Automata | 2011-02-11 | Paper |
Cellular automata and the quest for nontrivial artificial self-reproduction
Membrane Computing | 2011-01-21 | Paper |
Complexity of multi-head finite automata: origins and directions
Theoretical Computer Science | 2011-01-10 | Paper |
On stateless deterministic restarting automata
Acta Informatica | 2010-12-13 | Paper |
On stateless two-pushdown automata and restarting automata
International Journal of Foundations of Computer Science | 2010-11-11 | Paper |
Cellular automata with sparse communication
Theoretical Computer Science | 2010-10-07 | Paper |
Computations and decidability of iterative arrays with restricted communication
Parallel Processing Letters | 2010-09-29 | Paper |
Undecidability and hierarchy results for parallel communicating finite automata
Developments in Language Theory | 2010-08-31 | Paper |
The complexity of regular(-like) expressions
Developments in Language Theory | 2010-08-31 | Paper |
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
Lecture Notes in Computer Science | 2010-08-31 | Paper |
Reversible pushdown automata
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Dimension- and time-hierarchies for small time bounds.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Real-time reversible iterative arrays
Theoretical Computer Science | 2010-02-09 | Paper |
When Church-Rosser becomes context free
International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
Context-free grammars with linked nonterminals
International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
On input-revolving deterministic and nondeterministic finite automata
Information and Computation | 2009-11-27 | Paper |
Regulated nondeterminism in pushdown automata
Theoretical Computer Science | 2009-09-14 | Paper |
NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
International Journal of Foundations of Computer Science | 2009-08-21 | Paper |
Self-assembling finite automata
| 2009-08-10 | Paper |
Determination of finite automata accepting subregular languages
Theoretical Computer Science | 2009-08-07 | Paper |
Cellular Automata with Sparse Communication
Implementation and Application of Automata | 2009-07-09 | Paper |
More on the Size of Higman-Haines Sets: Effective Constructions
Fundamenta Informaticae | 2009-06-23 | Paper |
Undecidability of Operation Problems for T0L Languages and Subclasses
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Descriptional and Computational Complexity of Finite Automata
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Context-Dependent Nondeterminism for Pushdown Automata
Developments in Language Theory | 2009-03-26 | Paper |
More on the Size of Higman-Haines Sets: Effective Constructions
Lecture Notes in Computer Science | 2009-03-05 | Paper |
Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
Implementation and Applications of Automata | 2009-02-12 | Paper |
On Stateless Deterministic Restarting Automata
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Deterministic Input-Reversal and Input-Revolving Finite Automata
Language and Automata Theory and Applications | 2008-11-20 | Paper |
On the Computational Capacity of Parallel Communicating Finite Automata
Developments in Language Theory | 2008-10-30 | Paper |
Succinct description of regular languages by weak restarting automata
Information and Computation | 2008-10-08 | Paper |
Fast reversible language recognition using cellular automata
Information and Computation | 2008-10-08 | Paper |
OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
Cellular automata -- a computational point of view
| 2008-09-25 | Paper |
Non-recursive trade-offs for deterministic restarting automata
| 2008-08-12 | Paper |
Efficient pushdown cellular automata: universality, time and space hierarchies
| 2008-07-11 | Paper |
The Boolean closure of linear context-free languages
Acta Informatica | 2008-06-17 | Paper |
Regulated Nondeterminism in Pushdown Automata
Implementation and Application of Automata | 2008-06-10 | Paper |
HYBRID EXTENDED FINITE AUTOMATA
International Journal of Foundations of Computer Science | 2008-05-20 | Paper |
Real-Time Reversible Iterative Arrays
Fundamentals of Computation Theory | 2008-02-26 | Paper |
The size of Higman-Haines sets
Theoretical Computer Science | 2007-12-19 | Paper |
Hairpin Finite Automata
Developments in Language Theory | 2007-11-28 | Paper |
Finite turns and the regular closure of linear context-free languages
Discrete Applied Mathematics | 2007-09-21 | Paper |
Cellular devices and unary languages
| 2007-09-12 | Paper |
Hybrid Extended Finite Automata
Implementation and Application of Automata | 2007-09-06 | Paper |
Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Context-dependent nondeterminism for pushdown automata
Theoretical Computer Science | 2007-05-11 | Paper |
scientific article; zbMATH DE number 5117088 (Why is no real title available?)
| 2007-01-19 | Paper |
scientific article; zbMATH DE number 5051543 (Why is no real title available?)
| 2006-09-06 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Machines, Computations, and Universality
Lecture Notes in Computer Science | 2005-12-08 | Paper |
THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
International Journal of Foundations of Computer Science | 2005-11-14 | Paper |
NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
scientific article; zbMATH DE number 2201358 (Why is no real title available?)
| 2005-09-01 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
International Journal of Foundations of Computer Science | 2005-08-01 | Paper |
On the descriptional complexity of finite automata with modified acceptance conditions
Theoretical Computer Science | 2005-02-22 | Paper |
On the descriptional power of heads, counters, and pebbles
Theoretical Computer Science | 2005-02-22 | Paper |
scientific article; zbMATH DE number 2113944 (Why is no real title available?)
| 2004-11-05 | Paper |
scientific article; zbMATH DE number 2089986 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2079876 (Why is no real title available?)
| 2004-08-03 | Paper |
scientific article; zbMATH DE number 2068877 (Why is no real title available?)
| 2004-05-27 | Paper |
scientific article; zbMATH DE number 2040920 (Why is no real title available?)
| 2004-02-11 | Paper |
scientific article; zbMATH DE number 2038733 (Why is no real title available?)
| 2004-02-08 | Paper |
Fast one-way cellular automata.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1962776 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1949654 (Why is no real title available?)
| 2003-07-15 | Paper |
scientific article; zbMATH DE number 1948495 (Why is no real title available?)
| 2003-07-13 | Paper |
scientific article; zbMATH DE number 1886323 (Why is no real title available?)
| 2003-03-19 | Paper |
Massively parallel fault tolerant computations on syntactical patterns
Future Generation Computer Systems | 2003-01-21 | Paper |
Deterministic Turing machines in the range between real-time and linear-time.
Theoretical Computer Science | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1836417 (Why is no real title available?)
| 2002-11-27 | Paper |
scientific article; zbMATH DE number 1834667 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1759473 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1759411 (Why is no real title available?)
| 2002-11-04 | Paper |
scientific article; zbMATH DE number 1738667 (Why is no real title available?)
| 2002-05-07 | Paper |
On tally languages and generalized interacting automata
| 2001-04-04 | Paper |
scientific article; zbMATH DE number 1390061 (Why is no real title available?)
| 2000-10-03 | Paper |
scientific article; zbMATH DE number 714577 (Why is no real title available?)
| 2000-06-21 | Paper |
On time reduction and simulation in cellular spaces
International Journal of Computer Mathematics | 1999-09-01 | Paper |
scientific article; zbMATH DE number 1222612 (Why is no real title available?)
| 1999-06-21 | Paper |
Pushdown cellular automata
Theoretical Computer Science | 1999-04-28 | Paper |
On time computability of functions in one-way cellular automata
Acta Informatica | 1998-08-20 | Paper |
scientific article; zbMATH DE number 815072 (Why is no real title available?)
| 1995-11-12 | Paper |
scientific article; zbMATH DE number 4209629 (Why is no real title available?)
| 1991-01-01 | Paper |
