Finite State Two-Dimensional Compressibility

1992 ◽  
pp. 253-275 ◽  
Author(s):  
Dafna Sheinwald
Keyword(s):  
Two Dimensional ◽  
Finite State

Finite state induced flow models. I - Two-dimensional thin airfoil

1995 ◽  
Vol 32 (2) ◽  
pp. 313-322 ◽  
Author(s):  
David A. Peters ◽  
Swaminathan Karunamoorthy ◽  
Wen-Ming Cao
Keyword(s):  
Two Dimensional ◽  
Flow Models ◽  
Thin Airfoil ◽  
Finite State ◽  
Induced Flow

Preface

1997 ◽  
Vol 11 (07) ◽  
pp. 1023-1024
Author(s):  
Serge Miguet ◽  
Annick Montanvert ◽  
P. S. P. Wang
Keyword(s):  
Finite State Machine ◽  
Finite Automata ◽  
Upper Bounds ◽  
Two Dimensional ◽  
Turing Machines ◽  
Closure Properties ◽  
Working Space ◽  
Finite State ◽  
The Individual ◽  
Alternating Turing Machines

Several nonclosure properties of each class of sets accepted by two-dimensional alternating one-marker automata, alternating one-marker automata with only universal states, nondeterministic one-marker automata, deterministic one-marker automata, alternating finite automata, and alternating finite automata with only universal states are shown. To do this, we first establish the upper bounds of the working space used by "three-way" alternating Turing machines with only universal states to simulate those "four-way" non-storage machines. These bounds provide us a simplified and unified proof method for the whole variants of one-marker and/or alternating finite state machine, without directly analyzing the complex behavior of the individual four-way machine on two-dimensional rectangular input tapes. We also summarize the known closure properties including Boolean closures for all the variants of two-dimensional alternating one-marker automata.

TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY

1996 ◽  
Vol 25 (3,4) ◽  
pp. 399-422 ◽  
Author(s):  
Dora Giammarresi ◽  
Antonio Restivo
Keyword(s):  
Two Dimensional ◽  
Finite State

TRANSITIVITY IN TWO-DIMENSIONAL LOCAL LANGUAGES DEFINED BY DOT SYSTEMS

2006 ◽  
Vol 17 (02) ◽  
pp. 435-463 ◽  
Author(s):  
NATAŠA JONOSKA ◽  
JONI BURNETTE PIRNOT
Keyword(s):  
Finite Graph ◽  
Finite State Automaton ◽  
Two Dimensional ◽  
Entire Plane ◽  
Shift Spaces ◽  
Related Language ◽  
Finite State ◽  
Local Languages

The paper investigates two-dimensional recognizable languages that are defined by the so-called "dot systems" that are special subgroups of (ℤ/2ℤ)ℤ2. The dot shapes that provide directional transitivity or mixing for the related language are investigated. It is shown that languages defined by parallelogram shapes fail to be transitive in the direction of a defining vector and hence fail to be mixing, while certain triangular shapes guarantee that the factor language of the associated dot system will be mixing. Dot systems belong to a class of two-dimensional shift spaces that have a factor language such that every admissable block can be extended to a configuration of the entire plane. For this class of shift spaces we introduce a finite graph (i.e., a finite state automaton) that recognizes two-dimensional local languages, then show that certain transitivity properties may be observed from the structure of the finite graph.

scholarly journals A String Diagrammatic Axiomatisation of Finite-State Automata

2021 ◽  
pp. 469-489
Author(s):  
Robin Piedeleu ◽  
Fabio Zanasi
Keyword(s):  
Graphical Representation ◽  
Equational Theory ◽  
Finite State Automata ◽  
Regular Expressions ◽  
Two Dimensional ◽  
One Dimensional ◽  
Finite State ◽  
The One ◽  
Language Equivalence ◽  
Usual State

AbstractWe develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a complete equational theory for language equivalence, with two notable features. First, the proposed axiomatisation is finite— a result which is provably impossible for the one-dimensional syntax of regular expressions. Second, the Kleene star is a derived concept, as it can be decomposed into more primitive algebraic blocks.

Two-dimensional encoding by finite-state encoders

1990 ◽  
Vol 38 (3) ◽  
pp. 341-347 ◽  
Author(s):  
D. Sheinwald ◽  
A. Lempel ◽  
J. Ziv
Keyword(s):  
Two Dimensional ◽  
Finite State
Sign in / Sign up

Export Citation Format

Share Document