13 search results - page 1 / 3 » Tree Automata Make Ordinal Theory Easy |
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
DLT
2003
13 years 6 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
SIGCSE
1997
ACM
13 years 9 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...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...