scientific article; zbMATH DE number 1759611
From MaRDI portal
Publication:4536602
zbMATH Open0999.68139MaRDI QIDQ4536602FDOQ4536602
Authors: Oscar H. Ibarra, Tevfik Bultan, Jianwen Su 
Publication date: 28 November 2002
Title of this publication is not available (Why is that?)
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (14)
- Eliminating the storage tape in reachability constructions.
- On reachability and safety in infinite-state systems
- Automatic verification of recursive procedures with one integer parameter.
- The complexity of reversal-bounded model-checking
- Fixed point characterization of infinite behavior of finite-state systems
- Some decision problems concerning semilinearity and commutation.
- Augmenting the discrete timed automaton with other data structures.
- Grammatical characterizations of NPDAs and VPDAs with counters
- Title not available (Why is that?)
- On store languages and applications
- Semilinearity of families of languages
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
- Title not available (Why is that?)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536602)
