Automata and Languages

Meduna, Alexander

doi:10.1007/978-1-4471-0501-5

Cited by 73 publications

(20 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section we recall some notions related to formal language theory and array grammars (refer to [2,14]). Let Σ be a finite alphabet, card(Σ) denotes the cardinality of Σ. Σ * is the set of words over Σ including the empty word λ. Σ + = Σ * − {λ}.…”

Section: Preliminariesmentioning

confidence: 99%

Two-dimensional jumping finite automata

Thomas¹,

Immanuel²

2017

Math. Appl.

View full text Add to dashboard Cite

Abstract. In this paper, we extend a newly introduced concept called the jumping finite automata for accepting string languages to two-dimensional jumping finite automata for accepting two-dimensional languages. We discuss some of the basic properties of these automata and compare the family of languages accepted by these automata with the family of Siromoney matrix languages and also recognizable picture languages (REC). We also discuss some of the closure properties of these automata along with some of their decidability properties.

show abstract

Section: Preliminariesmentioning

confidence: 99%

Two-dimensional jumping finite automata

Thomas¹,

Immanuel²

2017

Math. Appl.

View full text Add to dashboard Cite

show abstract

“…We assume that the reader is familiar with formal language theory (see [18,19,20]). For every positive integer n, let I n denote the set {1, 2, .…”

Section: Preliminariesmentioning

confidence: 99%

Ordered Pure Multi-Pushdown Automata

Meduna¹,

Soukup²,

Zemek³

2015

Theor. Appl. Inform.

Self Cite

View full text Add to dashboard Cite

In the presented paper we discuss pure versions of pushdown automata that have no extra non-input symbols. More specifically, we study pure multi-pushdown automata, which have several pushdown lists. We restrict these automata by the total orders defined over their pushdowns or alphabets and determine the accepting power of the automata restricted in this way. Moreover, we explain the significance of the achieved results and relate them to some other results in the automata theory.

show abstract

“…In this paper, we assume the reader is familiar with the formal language theory (see [17]) and the basic aspects of computational linguistics (see [19]). …”

Section: Preliminariesmentioning

confidence: 99%

Rule-restricted Automaton-grammar transducers: Power and Linguistic Applications

Ak¹,

Cek²,

Meduna³

2012

Math. Appl.

Self Cite

View full text Add to dashboard Cite

Abstract. This paper introduces the notion of a new transducer as a two-component system, which consists of a finite automaton and a context-free grammar. In essence, while the automaton reads its input string, the grammar produces its output string, and their cooperation is controlled by a set, which restricts the usage of their rules.From a theoretical viewpoint, the present paper discusses the power of this system working in an ordinary way as well as in a leftmost way. In addition, the paper introduces an appearance checking, which allows us to check whether some symbols are present in the rewritten string, and studies its effect on the power. It achieves the following three main results. First, the system generates and accepts languages defined by matrix grammars and partially blind multi-counter automata, respectively. Second, if we place a leftmost restriction on derivation in the context-free grammar, both accepting and generating power of the system is equal to generative power of context-free grammars. Third, the system with appearance checking can accept and generate all recursively enumerable languages. From more pragmatical viewpoint, this paper describes several linguistic applications. A special attention is paid to the Japanese-Czech translation.

show abstract

Automata and Languages

Cited by 73 publications

References 0 publications

Two-dimensional jumping finite automata

Two-dimensional jumping finite automata

Ordered Pure Multi-Pushdown Automata

Rule-restricted Automaton-grammar transducers: Power and Linguistic Applications

Contact Info

Product

Resources

About