219 search results - page 26 / 44 » Combinatorial Complexity of Regular Languages |
102
click to vote
CSL
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
108
Voted
TABLEAUX
1999
Springer
15 years 4 months ago
1999
Springer
Appeared in: N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX’99), Lecture Notes in Artificial Intelligence 1617, Springer, pages 2...
111
click to vote
FUIN
2007
15 years 9 days ago
2007
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
93
Voted
IPL
2006
15 years 10 days ago
2006
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
115
Voted
COMGEO
2007
ACM
15 years 11 days ago
2007
ACM
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...