Add to ORKGWe introduce two-sided automata defined by directed graphs and describe all languages recognized by these automata.C
Two-dimensional languages can be recognized by tiling systems. A tiling system becomes an effective ...
AbstractNode label controlled (NLC) grammars are graph grammars (operating on node labeled undirecte...
We study final-state automata that work on directed acyclic graphs (DAGs). We consider ordered and u...
Graph grammars can be regarded as a generalization of context-free grammars from strings to graphs. ...
AbstractGraph grammars can be regarded as a generalization of context-free grammars from strings to ...
Abstract: In this paper we introduce alternating automata for languages of arrows of an arbitrary ca...
We introduce the two-dimensional rational automata (RA) to recognize languages of pictures, as an ex...
We introduce the two-dimensional rational automata (RA) to recognize languages of pictures, as an ex...
In this paper we study automata which work on directed ordered acyclic graphs, in particular those g...
Graphs have a variety of uses in natural language processing, particularly as representations of lin...
There are numerous connections between the theory of formal languages and that of symbolic dynamics....
We consider automata defined by left multiplications in graph algebras, and describe all languages r...
AbstractWe consider automata defined by graph algebras of directed graphs, characterize all congruen...
Two-dimensional languages can be recognized by tiling systems. A tiling system becomes an effective ...
AbstractNode label controlled (NLC) grammars are graph grammars (operating on node labeled undirecte...
We study final-state automata that work on directed acyclic graphs (DAGs). We consider ordered and u...
Graph grammars can be regarded as a generalization of context-free grammars from strings to graphs. ...
AbstractGraph grammars can be regarded as a generalization of context-free grammars from strings to ...
Abstract: In this paper we introduce alternating automata for languages of arrows of an arbitrary ca...
We introduce the two-dimensional rational automata (RA) to recognize languages of pictures, as an ex...
We introduce the two-dimensional rational automata (RA) to recognize languages of pictures, as an ex...
In this paper we study automata which work on directed ordered acyclic graphs, in particular those g...
Graphs have a variety of uses in natural language processing, particularly as representations of lin...
There are numerous connections between the theory of formal languages and that of symbolic dynamics....
We consider automata defined by left multiplications in graph algebras, and describe all languages r...
AbstractWe consider automata defined by graph algebras of directed graphs, characterize all congruen...
Two-dimensional languages can be recognized by tiling systems. A tiling system becomes an effective ...
AbstractNode label controlled (NLC) grammars are graph grammars (operating on node labeled undirecte...
We study final-state automata that work on directed acyclic graphs (DAGs). We consider ordered and u...