Results 301 to 310 of about 4,664,026 (360)

Unrestricted State Complexity of Binary Operations on Regular Languages

Workshop on Descriptional Complexity of Formal Systems, 2016
I study the state complexity of binary operations on regular languages over different alphabets. It is well known that if $L'_m$ and $L_n$ are languages restricted to be over the same alphabet, with $m$ and $n$ quotients, respectively, the state ...
J. Brzozowski
semanticscholar   +1 more source

Regular patterns, regular languages and context-free languages

Information Processing Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jain, S., Ong, Y.S., Stephan, F.
openaire   +2 more sources

Regular Component Splittable Languages

Acta Mathematica Hungarica, 1998
The authors study the problem of decomposing regular and context-free languages into regular components, where a regular component is a language of the form \(uv^+w\) \((u,w\in X^*\), \(v\in X^+\) for some alphabet \(X\)). A language is called (finitely) regular component splittable if it is a (finite) disjoint union of regular components and a finite ...
Shyr, H. J., Yu, S. S.
openaire   +1 more source

Separating Regular Languages by Piecewise Testable and Unambiguous Languages

International Symposium on Mathematical Foundations of Computer Science, 2013
Separation is a classical problem asking whether, given two sets belonging to some class, it is possible to separate them by a set from another class. We discuss the separation problem for regular languages. We give a Ptime algorithm to check whether two
Thomas Place, L. V. Rooijen, M. Zeitoun
semanticscholar   +1 more source

POWERS OF REGULAR LANGUAGES

International Journal of Foundations of Computer Science, 2009
In this paper we prove that it is decidable whether the set pow (L), which we get by taking all the powers of all the words in some regular language L, is regular or not. The problem was originally posed by Calbrix and Nivat in 1995. Partial solutions have been given by Cachat for unary languages and by Horváth et al. for various kinds of exponent sets
openaire   +1 more source

Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages

International Colloquium on Automata, Languages and Programming, 2021
Gabriel Bathie, Tatiana Starikovskaya
semanticscholar   +1 more source

Errors in Regular Languages

IEEE Transactions on Computers, 1974
Random occurrences of three types of errors in the input to a finite automaton are considered: an α error is a deletion of one symbol from the input string; a β error is an insertion of one extra symbol; and a δ error is a change of one symbol into another symbol.
openaire   +1 more source

Regular autodense languages

Acta Informatica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan, Chen-Ming, Huang, C. C., Shyr, H. J.   +2 more
openaire   +1 more source

Regular languages and stone duality

Theory of Computing Systems, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Deterministic regular languages

1992
The ISO standard for Standard Generalized Markup Language (SGML) provides a syntactic meta-language for the definition of textual markup systems. In the standard the right hand sides of productions are called {\sl content models} and they are based on regular expressions. The allowable regular expressions are those that are ``unambiguous'''' as defined
Anne Brüggemann-Klein, Derick Wood
openaire   +1 more source