Skip header Section
Skip Bibliometrics Section
Varieties Of Formal LanguagesApril 1986
- Author:
- Jean Eric Pin,
- Editor:
- Raymond E. Miller
Abstract
No abstract available.
Cited By
- Klíma O and Kolegar J Well Quasi-Orders Arising from Finite Ordered Semigroups Developments in Language Theory, (201-212)
Mereghetti C and Palano B (2021). Guest Column, ACM SIGACT News, 52:3, (38-59), Online publication date: 17-Oct-2021.- Manuel A and Nevatia D An algebraic characterisation of first-order logic with neighbour Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
- Barloy C, Murlak F and Paperman C Stackless Processing of Streamed Trees Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (109-125)
- Fleischer L and Kufleitner M (2019). Green's Relations in Deterministic Finite Automata, Theory of Computing Systems, 63:4, (666-687), Online publication date: 1-May-2019.
- Place T and Zeitoun M (2019). Going Higher in First-Order Quantifier Alternation Hierarchies on Words, Journal of the ACM, 66:2, (1-65), Online publication date: 26-Apr-2019.
- Kufleitner M and Wächter J (2018). The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy, Theory of Computing Systems, 62:3, (682-738), Online publication date: 1-Apr-2018.
- Vázquez de Parga M, García P and López D (2016). A sufficient condition to polynomially compute a minimum separating DFA, Information Sciences: an International Journal, 370:C, (204-220), Online publication date: 20-Nov-2016.
- Krebs A, Lodaya K, Pandya P and Straubing H Two-variable Logic with a Between Relation Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (106-115)
- Kufleitner M and Wächter J The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy Proceedings of the 11th International Computer Science Symposium on Computer Science --- Theory and Applications - Volume 9691, (237-250)
- Diekert V and Kufleitner M (2015). Omega-Rational Expressions with Bounded Synchronization Delay, Theory of Computing Systems, 56:4, (686-696), Online publication date: 1-May-2015.
- Bianchi M, Mereghetti C and Palano B (2014). Size lower bounds for quantum automata, Theoretical Computer Science, 551:C, (102-115), Online publication date: 25-Sep-2014.
- Kufleitner M and Lauser A The join levels of the trotter-weil hierarchy are decidable Proceedings of the 37th international conference on Mathematical Foundations of Computer Science, (603-614)
- Klíma O and Polák L Biautomata for k-piecewise testable languages Proceedings of the 16th international conference on Developments in Language Theory, (344-355)
- Krebs A and Lange K Dense completeness Proceedings of the 16th international conference on Developments in Language Theory, (178-189)
- Klíma O (2011). Piecewise testable languages via combinatorics on words, Discrete Mathematics, 311:20, (2124-2127), Online publication date: 1-Oct-2011.
- Golovkins M, Kravtsev M and Kravcevs V Quantum finite automata and probabilistic reversible automata Proceedings of the 36th international conference on Mathematical foundations of computer science, (351-363)
- Chaturvedi N, Olschewski J and Thomas W Languages vs. ω-languages in regular infinite games Proceedings of the 15th international conference on Developments in language theory, (180-191)
- Behle C, Krebs A and Reifferscheid S Typed monoids Proceedings of the 4th international conference on Algebraic informatics, (97-114)
- Pin J Theme and variations on the concatenation product Proceedings of the 4th international conference on Algebraic informatics, (44-64)
- Gelderie M Classifying regular languages via cascade products of automata Proceedings of the 5th international conference on Language and automata theory and applications, (286-297)
- Colcombet T Green's relations and their use in automata theory Proceedings of the 5th international conference on Language and automata theory and applications, (1-21)
- Lodaya K, Pandya P and Shah S Around dot depth two Proceedings of the 14th international conference on Developments in language theory, (303-315)
- Klíma O and Polák L On Schützenberger products of semirings Proceedings of the 14th international conference on Developments in language theory, (279-290)
- Eiter T, Gottlob G and Schwentick T The model checking problem for prefix classes of second-order logic Fields of logic and computation, (227-250)
- Maler O On the Krohn-Rhodes cascaded decomposition theorem Time for verification, (260-278)
- García P, Vázquez de Parga M, Cano A and López D (2009). On locally reversible languages, Theoretical Computer Science, 410:47-49, (4961-4974), Online publication date: 1-Nov-2009.
- Selivanov V (2008). Fine hierarchies and m-reducibilities in theoretical computer science, Theoretical Computer Science, 405:1-2, (116-163), Online publication date: 1-Oct-2008.
- Klíma O and Polák L Hierarchies of Piecewise Testable Languages Proceedings of the 12th international conference on Developments in Language Theory, (479-490)
- Kufleitner M The Height of Factorization Forests Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science, (443-454)
- Gómez A and Pin J A Robust Class of Regular Languages Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science, (36-51)
- Gómez A, Guaiana G and Pin J When Does Partial Commutative Closure Preserve Regularity? Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, (209-220)
- Rabinovich A and Thomas W Logical refinements of Church's problem Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic, (69-83)
- Colcombet T Factorisation forests for infinite words application to countable scattered linear orderings Proceedings of the 16th international conference on Fundamentals of Computation Theory, (226-237)
- Bloom S and Ésik Z Regular and algebraic words and ordinals Proceedings of the 2nd international conference on Algebra and coalgebra in computer science, (1-15)
- Salehi S and Steinby M (2007). Fundamental study, Theoretical Computer Science, 377:1-3, (1-24), Online publication date: 25-May-2007.
- Goode E and Pixton D (2007). Recognizing splicing languages, Discrete Applied Mathematics, 155:8, (989-1006), Online publication date: 1-Apr-2007.
- Branco M (2006). Two algebraic approaches to variants of the concatenation product, Theoretical Computer Science, 369:1, (406-426), Online publication date: 15-Dec-2006.
- García P and Ruiz J (2006). Learning in varieties of the form V*LI from positive data, Theoretical Computer Science, 362:1, (100-114), Online publication date: 11-Oct-2006.
- Mateescu A and Freund R (2006). Routes and Products of Monoids, Fundamenta Informaticae, 73:1,2, (205-211), Online publication date: 1-Oct-2006.
- Kufleitner M Polynomials, fragments of temporal logic and the variety DA over traces Proceedings of the 10th international conference on Developments in Language Theory, (37-48)
- Chaubard L, Pin J and Straubing H (2006). Actions, wreath products of C-varieties and concatenation product, Theoretical Computer Science, 356:1, (73-89), Online publication date: 5-May-2006.
- Mateescu A and Freund R (2006). Routes and Products of Monoids, Fundamenta Informaticae, 73:1,2, (205-211), Online publication date: 1-Apr-2006.
- Chaubard L C-varieties, actions and wreath product Proceedings of the 7th Latin American conference on Theoretical Informatics, (274-285)
- Béal M, Fiorenzi F and Perrin D (2005). A hierarchy of shift equivalent sofic shifts, Theoretical Computer Science, 345:2-3, (190-205), Online publication date: 22-Nov-2005.
- Beaudry M, Lemieux F and Thérien D Groupoids that recognize only regular languages Proceedings of the 32nd international conference on Automata, Languages and Programming, (421-433)
- Bedon N and Rispal C Schützenberger and eilenberg theorems for words on linear orderings Proceedings of the 9th international conference on Developments in Language Theory, (134-145)
- Ésik Z and Weil P (2005). Algebraic recognizability of regular tree languages, Theoretical Computer Science, 340:2, (291-321), Online publication date: 27-Jun-2005.
- Bonizzoni P and Mauri G (2005). Regular splicing languages and subclasses, Theoretical Computer Science, 340:2, (349-363), Online publication date: 27-Jun-2005.
- Cano A and García P Finite automata and unions of regular patterns with bounded constant segments Proceedings of the 10th international conference on Implementation and Application of Automata, (104-115)
- Pin J (2005). Expressive power of existential first-order sentences of Büchi's sequential calculus, Discrete Mathematics, 291:1-3, (155-174), Online publication date: 1-Mar-2005.
- Thérien D Regular languages, unambiguous concatenation and computational complexity Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science, (49-57)
- Domaratzki M (2004). Deletion along trajectories, Theoretical Computer Science, 320:2-3, (293-313), Online publication date: 14-Jun-2004.
- Gómez A and Pin J (2004). Shuffle on positive varieties of languages, Theoretical Computer Science, 312:2-3, (433-461), Online publication date: 30-Jan-2004.
- Guaiana G, Restivo A and Salemi S (2004). On the trace product and some families of languages closed under partial commutations, Journal of Automata, Languages and Combinatorics, 9:1, (61-79), Online publication date: 1-Jan-2004.
- Ésik Z and Németh Z (2004). Higher dimensional automata, Journal of Automata, Languages and Combinatorics, 9:1, (3-29), Online publication date: 1-Jan-2004.
- Serre O (2004). Vectorial languages and linear temporal logic, Theoretical Computer Science, 310:1-3, (79-116), Online publication date: 1-Jan-2004.
- Holzer M and König B On deterministic finite automata and syntactic monoid size, continued Proceedings of the 7th international conference on Developments in language theory, (349-360)
- Chattopadhyay A and Thérien D Locally commutative categories Proceedings of the 30th international conference on Automata, languages and programming, (984-995)
- Dömösi P, Nehaniv C and Rhodes J (2003). Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata, Theoretical Computer Science, 302:1-3, (295-317), Online publication date: 13-Jun-2003.
- Yli-Jyrä A Describing syntax with star-free regular expressions Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1, (379-386)
- Carton O and Michel M (2003). Unambiguous Büchi automata, Theoretical Computer Science, 297:1-3, (37-81), Online publication date: 17-Mar-2003.
- Pin J (2003). Algebraic tools for the concatenation product, Theoretical Computer Science, 292:1, (317-342), Online publication date: 21-Jan-2003.
- Grabmeier J, Kaltofen E and Weispfenning V Cited References Computer algebra handbook, (493-622)
- Ésik Z and Ito M (2003). Temporal logic with cyclic counting and the degree of aperiodicity of finite automata, Acta Cybernetica, 16:1, (1-28), Online publication date: 1-Jan-2003.
- Holzer M and König B On deterministic finite automata and syntactic monoid size Proceedings of the 6th international conference on Developments in language theory, (258-269)
- Matz O (2002). Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures, Theoretical Computer Science, 270:1-2, (1-70), Online publication date: 6-Jan-2002.
- Tesson P and Thérien D (2001). The computing power of programs over finite monoids, Journal of Automata, Languages and Combinatorics, 7:2, (247-258), Online publication date: 1-Nov-2001.
- Thérien D and Wilke T Over words, two variables are as powerful as one quantifier alternation Proceedings of the thirtieth annual ACM symposium on Theory of computing, (234-240)
- Barrington D and Straubing H (1995). Superlinear Lower Bounds for Bounded-Width Branching Programs, Journal of Computer and System Sciences, 50:3, (374-381), Online publication date: 1-Jun-1995.
Recommendations
Formal Semantics of Programming Languages
These notes give an overview of the main frameworks that have been developed for specifying the formal semantics of programming languages. Some of the pragmatic aspects of semantic descriptions are discussed, including modularity, and potential ...
M-solid varieties of languages
In this paper, a characterization of the language varieties and congruence varieties corresponding to M-solid pseudovarieties is presented. Taking into account the isomorphisms of the Eilenberg-type correspondences, each complete sublattice of ...
Informal and Formal Requirements Specification Languages: Bridging the Gap
The differences between informal and formal requirements specification languages are noted, and the issue of bridging the gap between them is discussed. Using structured analysis (SA) and the Vienna development method (VDM) as surrogates for informal ...