644 search results - page 18 / 129 » Precedence Automata and Languages |
FUIN
2002
13 years 7 months ago
2002
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
ISCAPDCS
2003
13 years 8 months ago
2003
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence de...
SIGCSE
1997
ACM
13 years 11 months ago
1997
ACM
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-peb...
LFCS
2009
Springer
13 years 12 months ago
2009
Springer
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...