scientific article; zbMATH DE number 3189697
From MaRDI portal
Publication:5725992
zbMath0116.33605MaRDI QIDQ5725992
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (74)
A Finite Axiomatisation of Finite-State Automata Using String Diagrams ⋮ Fuzzy terms ⋮ Brzozowski type determinization for fuzzy automata ⋮ Unrestricted complementation in language equations over a one-letter alphabet ⋮ On continuous nondeterminism and state minimality ⋮ On solving star equations ⋮ Quotients and atoms of reversible languages ⋮ On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs ⋮ Random Deterministic Automata ⋮ On the state complexity of reversals of regular languages ⋮ On equations for regular languages, finite automata, and sequential networks ⋮ A polynomial double reversal minimization algorithm for deterministic finite automata ⋮ La représentation ergodique d'un automate fini ⋮ More on Deterministic and Nondeterministic Finite Cover Automata ⋮ Expressive Capacity of Concatenation Freeness ⋮ Unnamed Item ⋮ Coalgebraic constructions of canonical nondeterministic automata ⋮ Singular value automata and approximate minimization ⋮ The size of power automata. ⋮ A graph theoretic approach to automata minimality ⋮ Observations on the complexity of regular expression problems ⋮ String matching algorithms and automata ⋮ Moore machines duality ⋮ Measuring power of generalised definite languages ⋮ Succinct representation of regular languages by Boolean automata ⋮ Duality of Lattices Associated to Left and Right Quotients ⋮ Nondeterministic Moore automata and Brzozowski's minimization algorithm ⋮ Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages ⋮ Reversal of binary regular languages ⋮ The word problem for \(\omega \)-terms over DA ⋮ On minimal realization for a fuzzy language and Brzozowski’s algorithm ⋮ Hopcroft’s Algorithm and Cyclic Automata ⋮ Theory of átomata ⋮ Unnamed Item ⋮ A string diagrammatic axiomatisation of finite-state automata ⋮ Standard Sturmian words and automata minimization algorithms ⋮ Cycle-aware minimization of acyclic deterministic finite-state automata ⋮ Coalgebraic minimization of automata by initiality and finality ⋮ Regular languages viewed from a graph-theoretic perspective ⋮ On Rough Approximations of Languages under Infinite Index Indiscernibility Relations ⋮ Description and analysis of a bottom-up DFA minimization algorithm ⋮ Transducers for the bidirectional decoding of prefix codes ⋮ On the size complexity of hybrid networks of evolutionary processors ⋮ Unnamed Item ⋮ Bideterministic automata and minimal representations of regular languages ⋮ NFA reduction algorithms by means of regular inequalities ⋮ Determination of finite automata accepting subregular languages ⋮ A mesh of automata ⋮ Unnamed Item ⋮ Five Determinisation Algorithms ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Quantitative simulations by matrices ⋮ Left-handed completeness ⋮ Circular Sturmian words and Hopcroft's algorithm ⋮ Incremental DFA Minimisation ⋮ The Booleanization of an inverse semigroup ⋮ A congruence-based perspective on automata minimization algorithms ⋮ Average complexity of Moore's and Hopcroft's algorithms ⋮ Locally testable languages ⋮ Minimisation of automata ⋮ Characterizations of locally testable events ⋮ Sorting and doubling techniques for set partitioning and automata minimization problems ⋮ Canonization of max-min fuzzy automata ⋮ Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton ⋮ The complexity of restricted regular expressions and the synthesis problem for finite automata ⋮ DFA minimization: double reversal versus split minimization algorithms ⋮ On classes of tractable unrestricted regular expressions ⋮ Proof-directed program transformation: A functional account of efficient regular expression matching ⋮ Closure properties of subregular languages under operations ⋮ Succinct representation of regular languages by Boolean automata. II ⋮ Yet another canonical nondeterministic automaton ⋮ A Congruence-Based Perspective on Finite Tree Automata ⋮ More on deterministic and nondeterministic finite cover automata ⋮ Concatenation-free languages
This page was built for publication:
