LANGAGE

swMATH501MaRDI QIDQ13257FDOQ13257

Author name not available (Why is that?)

Described by source

• LANGAGE: A Maple package for automaton characterization of regular languages

Cited In (38)

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

This page was built for software: LANGAGE