LANGAGE
From MaRDI portal
Software:13257
No author found.
Related Items (38)
Some properties of Ising automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Obtaining shorter regular expressions from finite-state automata ⋮ Series parallel digraphs with loops ⋮ Unnamed Item ⋮ Beyond operator-precedence grammars and languages ⋮ Efficient weighted expressions conversion ⋮ Unnamed Item ⋮ On the descriptional complexity of stateless deterministic ordered restarting automata ⋮ Sampling different kinds of acyclic automata using Markov chains ⋮ A characterization of Thompson digraphs. ⋮ Acyclic automata and small expressions using multi-tilde-bar operators ⋮ Unnamed Item ⋮ Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order ⋮ Reducing the Time Complexity of Testing for Local Threshold Testability ⋮ Generalizations of 1-deterministic regular languages ⋮ More concise representation of regular languages by automata and regular expressions ⋮ Execution monitoring enforcement under memory-limitation constraints ⋮ Acyclic networks maximizing the printing complexity ⋮ Reducing the time complexity of testing for local threshold testability ⋮ Derivatives of rational expressions with multiplicity ⋮ Multi-tilde-bar expressions and their automata ⋮ How expressions can code for automata ⋮ A New Family of Regular Operators Fitting with the Position Automaton Computation ⋮ Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet ⋮ Weak Inclusion for XML Types ⋮ Random Generation of Deterministic Acyclic Automata Using Markov Chains ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ Position Automaton Construction for Regular Expressions with Intersection ⋮ Small Extended Expressions for Acyclic Automata ⋮ Automata and rational expressions ⋮ Families of locally testable languages ⋮ Optimal estimation on the order of local testability of finite automata ⋮ Characterization of Glushkov automata ⋮ The Bottom-Up Position Tree Automaton and the Father Automaton ⋮ On the hierarchy of generalizations of one-unambiguous regular languages
This page was built for software: LANGAGE
