Sciweavers

2467 search results - page 139 / 494
» Finite State Machines
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
Parikh Images of Regular Languages: Complexity and Applications
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...
Anthony Widjaja To
CCS
2008
ACM
15 years 8 months ago
Stale-safe security properties for group-based secure information sharing
Attribute staleness arises due to the physical distribution of authorization information, decision and enforcement points. This is a fundamental problem in virtually any secure di...
Ram Krishnan, Jianwei Niu, Ravi S. Sandhu, William...
CP
2000
Springer
15 years 10 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
LICS
2007
IEEE
16 years 25 days ago
First-Order and Temporal Logics for Nested Words
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
Rajeev Alur, Marcelo Arenas, Pablo Barceló,...
ACL
1990
15 years 7 months ago
Deterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
Yves Schabes, K. Vijay-Shanker