Publication:4536602
From MaRDI portal
zbMath0999.68139MaRDI QIDQ4536602
Jianwen Su, Tevfik Bultan, Oscar H. Ibarra
Publication date: 28 November 2002
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Semilinearity of Families of Languages, State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs, Automatic verification of recursive procedures with one integer parameter., Grammatical characterizations of NPDAs and VPDAs with counters, Augmenting the discrete timed automaton with other data structures., Some decision problems concerning semilinearity and commutation., Eliminating the storage tape in reachability constructions., On store languages and applications, The Complexity of Reversal-Bounded Model-Checking