RS -Machines with Almost Blank Tape
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A useful device for showing the solvability of some decision problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
Decidable problems for powerful programs
Journal of the ACM (JACM)
On the containment and equivalence of database queries with linear constraints (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An NP-Complete Number-Theoretic Problem
Journal of the ACM (JACM)
The Complexity of the Equivalence Problem for Simple Programs
Journal of the ACM (JACM)
Two-Way Counter Machines and Diophantine Equations
Journal of the ACM (JACM)
Modelization of deterministic rational relations
Theoretical Computer Science
Timing Diagrams: Formalization and Algorithmic Verification
Journal of Logic, Language and Information
Counter machines and verification Problems
Theoretical Computer Science
Augmenting the discrete timed automaton with other data structures
Theoretical Computer Science
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Removing the Pushdown Stack in Reachability Constructions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Reachability Analysis for Some Models of Infinite-State Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Reachability and Safety in Queue Systems
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Generalizing the Discrete Timed Automaton
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Automatic Verification of Recursive Procedures with One Integer Parameter
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Generalized discrete timed automata: decidable approximations for safety verification
Theoretical Computer Science - Computing and combinatorics
Automatic verification of recursive procedures with one integer parameter
Theoretical Computer Science - Mathematical foundations of computer science
Verification in loosely synchronous queue-connected discrete timed automata
Theoretical Computer Science
Presburger liveness verification of discrete timed automata
Theoretical Computer Science
Eliminating the storage tape in reachability constructions
Theoretical Computer Science
Reversal complexity of counter machines
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An NP-complete number-theoretic problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Pushdown timed automata: a binary reachability characterization and safety verification
Theoretical Computer Science
Closure and decidability properties of some language classes with respect to ciliate bio-operations
Theoretical Computer Science
The ld and dlad bio-operations on formal languages
Journal of Automata, Languages and Combinatorics
On two-way FA with monotonic counters and quadratic Diophantine equations
Theoretical Computer Science
Catalytic P systems, semilinear sets, and vector addition systems
Theoretical Computer Science
Past pushdown timed automata and safety verification
Theoretical Computer Science - Implementation and application automata
Families of languages defined by ciliate bio-operations
Theoretical Computer Science
On the computational complexity of membrane systems
Theoretical Computer Science
On two-way nondeterministic finite automata with one reversal-bounded counter
Theoretical Computer Science - Insightful theory
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
Separability of rational relations in A* × Nm by recognizable relations is decidable
Information Processing Letters
On partially blind multihead finite automata
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On composition and lookahead delegation of e-services modeled by automata
Theoretical Computer Science
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
On codes defined by bio-operations
Theoretical Computer Science
Reversal-Bounded Counter Machines Revisited
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Bad News on Decision Problems for Patterns
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Verification of qualitative Z constraints
Theoretical Computer Science
Simulating one-reversal multicounter machines by partially blind multihead finite automata
Theoretical Computer Science
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Flat Parametric Counter Automata
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Reachability in Timed Counter Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Cellular Automata with Sparse Communication
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Hierarchies and Characterizations of Stateless Multicounter Machines
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On Stateless Multicounter Machines
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Bad news on decision problems for patterns
Information and Computation
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Safety verification for two-way finite automata with monotonic counters
DLT'02 Proceedings of the 6th international conference on Developments in language theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Monadic second-order logics with cardinalities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science
On (Omega-)regular model checking
ACM Transactions on Computational Logic (TOCL)
Computational power of two stacks with restricted communication
Information and Computation
Cellular automata with sparse communication
Theoretical Computer Science
On the universe, disjointness, and containment problems for simple machines
Information and Computation
Schema for parallel insertion and deletion
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On the joint spectral radius for bounded matrix languages
RP'10 Proceedings of the 4th international conference on Reachability problems
Properties of visibly pushdown transducers
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
Limitations of self-assembly at temperature 1
Theoretical Computer Science
One-reversal counter machines and multihead automata: revisited
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Two-party Watson-Crick computations
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
International Journal of Geographical Information Science
On lifecycle constraints of artifact-centric workflows
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
On the decidability of model-checking for P systems
Journal of Automata, Languages and Combinatorics
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Model checking recursive programs with numeric data types
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
On the containment and equivalence problems for GSMs, transducers, and linear CFGs
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
On synchronized multitape and multihead automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
The complexity of reversal-bounded model-checking
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Characterizations of some restricted spiking neural p systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Branching-time temporal logic extended with qualitative presburger constraints
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Flat parametric counter automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
On symport/antiport p systems and semilinear sets
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Adding monotonic counters to automata and transition graphs
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
The inclusion problem for unambiguous rational trace languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Fast iterative arrays with restricted inter-cell communication: constructions and decidability
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Composability of infinite-state activity automata
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Viral gene compression: complexity and verification
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Real-Counter automata and their decision problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
On CD-systems of stateless deterministic R-automata with window size one
Journal of Computer and System Sciences
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Post correspondence problem with partially commutative alphabets
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
On the containment and equivalence problems for two-way transducers
Theoretical Computer Science
When model-checking freeze LTL over counter machines becomes decidable
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Multitape NFA: weak synchronization of the input heads
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Strong termination for gap-order constraint abstractions of counter systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Weak synchronization and synchronizability of multitape pushdown automata and turing machines
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On synchronized multi-tape and multi-head automata
Theoretical Computer Science
Artifact systems with data dependencies and arithmetic
ACM Transactions on Database Systems (TODS)
Finite automata over structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A Perfect Model for Bounded Verification
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Synchronisation- and reversal-bounded analysis of multithreaded programs with counters
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Flat Parametric Counter Automata
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Unambiguous constrained automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
One-reversal counter machines and multihead automata: Revisited
Theoretical Computer Science
A Survey of Results on Stateless Multicounter Automata
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
How to synchronize the heads of a multitape automaton
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Automata with modulo counters and nondeterministic counter bounds
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
On selective unboundedness of VASS
Journal of Computer and System Sciences
Similarity in languages and programs
Theoretical Computer Science
Some decision problems concerning NPDAs, palindromes, and dyck languages
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
On the open problem of Ginsburg concerning semilinear sets and related problems
Theoretical Computer Science
Verification of gap-order constraint abstractions of counter systems
Theoretical Computer Science
On computational complexity of graph inference from counting
Natural Computing: an international journal
Decision Problems for Probabilistic Finite Automata on Bounded Languages
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.03 |