Canonical Nondeterministic Automata

@inproceedings{Myers2014CanonicalNA,
  title={Canonical Nondeterministic Automata},
  author={Robert S. R. Myers and Jir{\'i} Ad{\'a}mek and Stefan Milius and Henning Urbat},
  booktitle={CMCS},
  year={2014}
}
For each regular language \(L\) we describe a family of canonical nondeterministic acceptors (nfas). Their construction follows a uniform recipe: build the minimal dfa for \(L\) in a locally finite variety \(\mathcal {V}\), and apply an equivalence between the finite \(\mathcal {V}\)-algebras and a category of finite structured sets and relations. By instantiating this to different varieties we recover three well-studied canonical nfas (the atomaton, the jiromaton and the minimal xor automaton… 

Coalgebraic constructions of canonical nondeterministic automata

Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton

TLDR
This work generalizes the double-reversal method of finding a canonical RFSA, presented by Denis, Lemay, and Terlutte, and studies the relationship of RFSAs with atoms of regular languages.

Automata Learning: An Algebraic Approach

TLDR
Using the concept of an automata presentation of T-algebras, it is demonstrated that the task of learning a T-recognizable language can be reduced to learning an abstract form of algebraic automaton whose transitions are modeled by a functor.

Topological theories and automata

The paper explains the connection between topological theories for one-manifolds with defects and values in the Boolean semiring and automata and their generalizations. Finite state automata are

Syntactic Monoids in a Category

TLDR
It is proved that the syntactic D-monoid of a language L can be constructed as a quotient of a free D- monoid modulo the syntactical congruence of L, and that it is isomorphic to the transition D-Monoid of the minimal automaton for L in D.

References

SHOWING 1-10 OF 26 REFERENCES

Theory of átomata

Residual Finite State Automata

TLDR
It is proved that every regular language is recognized by a unique (canonical) RFSA which has a minimal number of states and a maximal number of transitions.

Generalizing determinization from automata to coalgebras

TLDR
This paper lifts the powerset construction from automata to the more general framework of coal- gebras with structured state spaces and shows how to characterize coalgebraically several equivalences which have been object of interest in the concurrency community, such as failure or ready semantics.

A Coalgebraic Perspective on Minimization and Determinization

TLDR
This paper uses the coalgebraic view on systems to derive, in a uniform way, abstract procedures for checking behavioural equivalence in coalgebras, which perform (a combination of) minimization and determinization.

Sound and Complete Axiomatizations of Coalgebraic Language Equivalence

TLDR
This article investigates under which conditions calculi that are sound and complete with respect to behavioral equivalence can be extended to a coarser coalgebraic language equivalence, which arises from a generalized powerset construction that determinizes coalgebras.

Efficient Equivalence and Minimization for Non Deterministic Xor Automata

TLDR
A cubic time algorithm is presented to reduce a xor-automaton to a minimal form M = MXA(A), within the least possible number of states, a finite strong normal form and automata equivalence is efficiently decided through reduction to the SNF.

Free-Algebra Models for the pi-Calculus

TLDR
A novel algebraic description for models of the @p-calculus is obtained, and an existing construction is validated as the universal such model, and it is generalised to prove that all free-algebra models are fully abstract.

The universal automaton

TLDR
It is shown how the universal automaton gives an elegant solution to the star height problem for some classes of languages (pure-group or reversible languages).

A coalgebraic perspective on linear weighted automata

Iterative algebras at work

TLDR
This paper shows that by starting with ‘iterative algebras’, that is, algeBRas admitting a unique solution of all systems of flat recursive equations, a free iterative theory is obtained as the theory of free iteratives alge bras.