Author of the publication

Most Complex Non-Returning Regular Languages.

, and . Int. J. Found. Comput. Sci., 30 (6-7): 921-957 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Developments in the Theory of regular Languages.. IFIP Congress, page 29-40. (1980)Semilattices of Fault Semiautomata., and . Jewels are Forever, page 3-15. Springer, (1999)Decision Problems for Convex Languages., , and . LATA, volume 5457 of Lecture Notes in Computer Science, page 247-258. Springer, (2009)Relative liveness: from intuition to automated verification., and . ASYNC, page 108-117. IEEE Computer Society, (1995)Simulation of Gate Circuits with Feedback in Multi-Valued Algebras., and . ISMVL, page 46. IEEE Computer Society, (2007)Recent Developments in the Design of Asynchronous Circuits., and . FCT, volume 380 of Lecture Notes in Computer Science, page 78-94. Springer, (1989)Syntactic Complexities of Some Classes of Star-Free Languages., and . DCFS, volume 7386 of Lecture Notes in Computer Science, page 117-129. Springer, (2012)Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages., , and . DCFS, volume 6808 of Lecture Notes in Computer Science, page 93-106. Springer, (2011)Syntactic Complexity of - and -Trivial Regular Languages., and . DCFS, volume 8031 of Lecture Notes in Computer Science, page 160-171. Springer, (2013)A Characterization of Finite Ternary Algebras., , and . Int. J. Algebra Comput., 7 (6): 713-722 (1997)