scientific article; zbMATH DE number 3189697

Cited in

(83)

On equations for regular languages, finite automata, and sequential networks
On Rough Approximations of Languages under Infinite Index Indiscernibility Relations
Reversal of binary regular languages
Expressive completeness by separation for discrete time interval temporal logic with expanding modalities
Transducers for the bidirectional decoding of prefix codes
On solving star equations
Generalization of the double-reversal method of finding a canonical residual finite state automaton
The size of power automata.
On classes of tractable unrestricted regular expressions
Yet another canonical nondeterministic automaton
On the state complexity of reversals of regular languages
On the power of automata minimization in reactive synthesis
More on deterministic and nondeterministic finite cover automata (extended abstract)
A graph theoretic approach to automata minimality
Bideterministic automata and minimal representations of regular languages
Fuzzy terms
Brzozowski type determinization for fuzzy automata
On continuous nondeterminism and state minimality
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
Incremental DFA minimisation
Coalgebraic minimization of automata by initiality and finality
A string diagrammatic axiomatisation of finite-state automata
scientific article; zbMATH DE number 7559411 (Why is no real title available?)
Circular Sturmian words and Hopcroft's algorithm
NFA reduction algorithms by means of regular inequalities
Description and analysis of a bottom-up DFA minimization algorithm
Minimisation of automata
Succinct representation of regular languages by Boolean automata. II
Proof-directed program transformation: a functional account of efficient regular expression matching
Forbidden patterns for ordered automata
Observations on the complexity of regular expression problems
Singular value automata and approximate minimization
Nondeterministic Moore automata and Brzozowski's minimization algorithm
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
Quantitative simulations by matrices
DFA minimization: double reversal versus split minimization algorithms
Concatenation-free languages
More on deterministic and nondeterministic finite cover automata
La représentation ergodique d'un automate fini
Quotients and atoms of reversible languages
Hopcroft’s Algorithm and Cyclic Automata
Closure properties of subregular languages under operations
Left-handed completeness
Minimisation in logical form
On the size complexity of hybrid networks of evolutionary processors
A sufficient condition to polynomially compute a minimum separating DFA
Succinct representation of regular languages by Boolean automata
String matching algorithms and automata
Unrestricted complementation in language equations over a one-letter alphabet
Canonization of max-min fuzzy automata
A congruence-based perspective on automata minimization algorithms
Expressive capacity of concatenation freeness
The word problem for \(\omega \)-terms over DA
On minimal realization for a fuzzy language and Brzozowski's algorithm
A mesh of automata
Measuring power of generalised definite languages
Average complexity of Moore's and Hopcroft's algorithms
Duality of Lattices Associated to Left and Right Quotients
Characterizations of locally testable events
The Booleanization of an inverse semigroup
Reasoning About Regular Properties: A Comparative Study
String editing under pattern constraints
Cycle-aware minimization of acyclic deterministic finite-state automata
Standard Sturmian words and automata minimization algorithms
A congruence-based perspective on finite tree automata
The complexity of restricted regular expressions and the synthesis problem for finite automata
Canonical automata via distributive law homomorphisms
Simplifying Alternating Automata for Emptiness Testing
Determination of finite automata accepting subregular languages
Moore machines duality
A Finite Axiomatisation of Finite-State Automata Using String Diagrams
Theory of átomata
scientific article; zbMATH DE number 3293675 (Why is no real title available?)
Locally testable languages
scientific article; zbMATH DE number 7524066 (Why is no real title available?)
Sorting and doubling techniques for set partitioning and automata minimization problems
Incremental dead state detection in logarithmic time
Regular languages viewed from a graph-theoretic perspective
Five Determinisation Algorithms
Coalgebraic constructions of canonical nondeterministic automata
A polynomial double reversal minimization algorithm for deterministic finite automata
Yet another canonical nondeterministic automaton
Random deterministic automata

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5725992)