scientific article; zbMATH DE number 1759611
From MaRDI portal
Publication:4536602
zbMath0999.68139MaRDI QIDQ4536602
Jianwen Su, Tevfik Bultan, Oscar H. Ibarra
Publication date: 28 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items (9)
Some decision problems concerning semilinearity and commutation. ⋮ Eliminating the storage tape in reachability constructions. ⋮ The Complexity of Reversal-Bounded Model-Checking ⋮ On store languages and applications ⋮ 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 ⋮ Semilinearity of Families of Languages ⋮ Augmenting the discrete timed automaton with other data structures.
This page was built for publication:
