371 search results - page 24 / 75 » Pushdown Automata Simulator |
102
click to vote
COGSCI
2010
15 years 1 months ago
2010
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
107
click to vote
INFORMATICALT
2000
15 years 1 months ago
2000
Abstract. We consider in this paper so called simple bracketed languages having special limitations. They are sometimes used for the definitions of some grammatical structures of p...
CONCUR
2003
Springer
15 years 7 months ago
2003
Springer
We establish that on the domain of probabilistic automata, the trace distribution precongruence coincides with the simulation preorder.
119
Voted
LATIN
1995
Springer
15 years 5 months ago
1995
Springer
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning au...
ACTA
2004
15 years 1 months ago
2004
The generative capability of several variants of P systems with symport/antiport is studied via the simulation of counter automata. This leads to the reduction of the complexity, e...