Justus-Liebig-Universität Gießen · 2005 · 31 citations · 4 references
ComputingComputer ScienceMathematicsRepresentation TheoryAutomata TheoryFinite AutomataPattern RecognitionContext-sensitive LanguagesFinite Automata TheoryWeighted AutomataWeighted Finite-state Automata
We introduce quadrapolic automata whose behaviours are the recognizable picture languages. The quadrapolic automata weighted over a semiring compute picture series which have nice properties. The eastern faces of such series form a class of word series having properties similar to those of context-sensitive word languages.
4