For each class in the piecewise-local subregular hierarchy, a relativized (tier-based) variant is defined. Algebraic as well as automata-, language-, and model-theoretic characterizations are provided for each of these relativized classes, except in cases where this is provably impossible. These various characterizations are necessarily intertwined due to the well-studied logic-automaton connection and the relationship between finite-state automata and (syntactic) semigroups. Closure properties of each class are demonstrated by using automata-theoretic methods to provide constructive proofs for the closures that do hold and giving language-theoretic counterexamples for those that do not. The net result of all of this is that, rather than me...
Abstract. The Pin-Reutenauer algorithm gives a method, that can be viewed as a descriptive procedure...
AbstractBy applying descriptive set theory to the Wagner's fine structure of regular ω-languages we ...
We investigate a famous decision problem in automata theory: separation.Given a class of language C,...
For each class in the piecewise-local subregular hierarchy, a relativized (tier-based) variant is de...
International audienceIn 1970, R. S. Cohen and Janusz A. Brzozowski introduced a hierarchy of star-f...
New connections are discovered between formal language theory and model theory. We give logical char...
AbstractVarious syntactical phenomena play an important role when developing grammars for natural la...
This chapter gives an overview on what is often called the algebraic theory of finite automata. It d...
Local automata are defined as labeled monadic algebras that interact and accept or reject each other...
AbstractTree controlled grammars are context-free grammars where the associated language only contai...
We define a generalization of the finite state acceptors for derivation structures and for phrase st...
We define a class of ranked tree automata TABG generalizing both the treeautomata with local tests b...
Abstract. Existing definitions of the relativizations of NC 1, L and NL do not preserve the inclusio...
Automata theory is intimately related to the theories of directed and topological graphs, semigroup ...
AbstractWe introduce a new class of tree automata, which we call Reduction Automata (RA), and we use...
Abstract. The Pin-Reutenauer algorithm gives a method, that can be viewed as a descriptive procedure...
AbstractBy applying descriptive set theory to the Wagner's fine structure of regular ω-languages we ...
We investigate a famous decision problem in automata theory: separation.Given a class of language C,...
For each class in the piecewise-local subregular hierarchy, a relativized (tier-based) variant is de...
International audienceIn 1970, R. S. Cohen and Janusz A. Brzozowski introduced a hierarchy of star-f...
New connections are discovered between formal language theory and model theory. We give logical char...
AbstractVarious syntactical phenomena play an important role when developing grammars for natural la...
This chapter gives an overview on what is often called the algebraic theory of finite automata. It d...
Local automata are defined as labeled monadic algebras that interact and accept or reject each other...
AbstractTree controlled grammars are context-free grammars where the associated language only contai...
We define a generalization of the finite state acceptors for derivation structures and for phrase st...
We define a class of ranked tree automata TABG generalizing both the treeautomata with local tests b...
Abstract. Existing definitions of the relativizations of NC 1, L and NL do not preserve the inclusio...
Automata theory is intimately related to the theories of directed and topological graphs, semigroup ...
AbstractWe introduce a new class of tree automata, which we call Reduction Automata (RA), and we use...
Abstract. The Pin-Reutenauer algorithm gives a method, that can be viewed as a descriptive procedure...
AbstractBy applying descriptive set theory to the Wagner's fine structure of regular ω-languages we ...
We investigate a famous decision problem in automata theory: separation.Given a class of language C,...