Ultimate-Definite and Symmetric-Definite Events and Automata

Authors:
A. Paz;B. Peleg
Affiliations:
Technion, Israel Institute of Technology, Haifa;The Hebrew University, Jerusalem
Venue:
Journal of the ACM (JACM)
Year:
1965

Citing 1
Cited 11

Derivatives of Regular Expressions

Journal of the ACM (JACM)

On Decompositions of Regular Events

Journal of the ACM (JACM)
Synchronizations and General Repetitive Machines, with Applications to Ultimate Definite Automata

Journal of the ACM (JACM)
On regular languages determined by nondeterministic directable automata

Acta Cybernetica
General Repetitive Events and Machines

IEEE Transactions on Computers
A Study of Trigger Machines

IEEE Transactions on Computers
Determination of finite automata accepting subregular languages

Theoretical Computer Science
Decision problems for convex languages

Information and Computation
Quotient complexity of ideal languages

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Complexity in convex languages

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Regular ideal languages and their boolean combinations

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Quotient complexity of ideal languages

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

New classes of events and finite automata which generalize the noninitial definite class are introduced. These events, called “ultimate definite” (u.d.), “reverse u.d.” and “symmetric definite,” are investigated as to algebraic and closure properties. Effective decision procedures whereby it can be decided whether a given finite automata defines such an event are given and unique canonical representations for these events are derived.