✦ LIBER ✦

The Best Nondeterministic Representations of Finite Orderings

✍ Scribed by C.R. Vela; A. Bahamonde

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 556 KB
Volume: 51
Category: Article
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1084

No coin nor oath required. For personal study only.

✦ Synopsis

This paper formally presents an algorithm to compute the nondeterministic realization with the least number of states that represents an order relation. For this purpose, each input order relation is considered as a finite automaton in a straightforward way. Then the automaton is subject to an iterative reduction process where the main tool for removing states is scoop minimization. So states whose role can be accomplished by a set of other states can be skipped. Moreover, we can create new states to allow further scoop reductions. The algorithm can be configured by the user to bound its performance to polynomial time. c' 1995 Academic Press, Inc.

📜 SIMILAR VOLUMES

Two representations of finite ordered se

Two representations of finite ordered sets

✍ A. Batbedat 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 624 KB

Primary Orders of Finite Representation

Primary Orders of Finite Representation Type

✍ Hiroaki Hijikata; Kenji Nishida 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Recall the well-known theorem of Drozd and Kirichenko cf. Yu. A. Drozd and Ž . . V. V. Kirichenko, Math. USSR Iz¨estia 7 1973 , 711᎐732 giving a necessary and sufficient condition for a primary order ⌳ to be of finite representation type. Such Ž . ⌳s that satisfy the ''necessary condition'' of the D

Local crossed-product orders of finite r

Local crossed-product orders of finite representation type

✍ Th. Theohari-Apostolidi 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 560 KB

A lower bound technique for the size of

A lower bound technique for the size of nondeterministic finite automata

✍ Ian Glaister; Jeffrey Shallit 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Finite Languages for the Representation

Finite Languages for the Representation of Finite Graphs

✍ Andrzej Ehrenfeucht; Joost Engelfriet; Grzegorz Rozenberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 538 KB

We introduce a new way of specifying graphs: through languages, i.e., sets of strings. The strings of a given (finite, prefix-free) language represent the vertices of the graph; whether or not there is an edge between the vertices represented by two strings is determined by the pair of symbols at th

The Graphical Regular Representations of

The Graphical Regular Representations of Finite Metacyclicp-Groups

✍ Cai Heng Li; Hyo-Seob Sim 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 136 KB

A Cayley graph = Cay(G, S) is called a graphical regular representation of the group G if Aut = G. One long-standing open problem about Cayley graphs is to determine which Cayley graphs are graphical regular representations of the corresponding groups. A simple necessary condition for to be a graphi